./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e7bf678f67bc088f549a4abb07f450d970cef489f8318e3fb7c3771679b9e87b --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:33:10,628 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:33:10,678 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:33:10,681 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:33:10,681 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:33:10,701 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:33:10,702 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:33:10,702 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:33:10,702 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:33:10,702 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:33:10,703 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:33:10,703 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:33:10,703 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:33:10,703 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:33:10,704 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:33:10,704 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:33:10,704 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:33:10,704 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:33:10,704 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:33:10,704 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:33:10,704 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:33:10,704 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:33:10,704 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:33:10,705 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:33:10,705 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:33:10,705 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:33:10,705 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:33:10,705 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:33:10,705 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:33:10,705 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:33:10,705 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:33:10,705 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:33:10,706 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:33:10,706 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:33:10,706 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:33:10,706 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:33:10,706 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:33:10,706 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:33:10,706 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:33:10,706 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:33:10,706 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:33:10,706 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:33:10,706 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:33:10,706 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 -> e7bf678f67bc088f549a4abb07f450d970cef489f8318e3fb7c3771679b9e87b [2025-03-16 19:33:10,921 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:33:10,929 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:33:10,931 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:33:10,932 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:33:10,933 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:33:10,933 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2025-03-16 19:33:12,081 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab441a365/f6a6407b7142469f8a49c65ca38b8d12/FLAG6a935257c [2025-03-16 19:33:12,407 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:33:12,408 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2025-03-16 19:33:12,414 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab441a365/f6a6407b7142469f8a49c65ca38b8d12/FLAG6a935257c [2025-03-16 19:33:12,425 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab441a365/f6a6407b7142469f8a49c65ca38b8d12 [2025-03-16 19:33:12,427 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:33:12,428 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:33:12,428 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:33:12,429 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:33:12,432 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:33:12,435 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:33:12" (1/1) ... [2025-03-16 19:33:12,436 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64bc7117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:33:12, skipping insertion in model container [2025-03-16 19:33:12,436 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:33:12" (1/1) ... [2025-03-16 19:33:12,458 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:33:12,622 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.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c[7981,7994] [2025-03-16 19:33:12,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:33:12,685 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:33:12,732 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.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c[7981,7994] [2025-03-16 19:33:12,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:33:12,771 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:33:12,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:33:12 WrapperNode [2025-03-16 19:33:12,774 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:33:12,774 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:33:12,775 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:33:12,775 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:33:12,779 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:33:12" (1/1) ... [2025-03-16 19:33:12,786 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:33:12" (1/1) ... [2025-03-16 19:33:12,805 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 688 [2025-03-16 19:33:12,806 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:33:12,806 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:33:12,806 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:33:12,806 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:33:12,817 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:33:12" (1/1) ... [2025-03-16 19:33:12,818 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:33:12" (1/1) ... [2025-03-16 19:33:12,825 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:33:12" (1/1) ... [2025-03-16 19:33:12,846 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 19:33:12,846 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:33:12" (1/1) ... [2025-03-16 19:33:12,846 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:33:12" (1/1) ... [2025-03-16 19:33:12,860 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:33:12" (1/1) ... [2025-03-16 19:33:12,862 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:33:12" (1/1) ... [2025-03-16 19:33:12,863 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:33:12" (1/1) ... [2025-03-16 19:33:12,866 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:33:12" (1/1) ... [2025-03-16 19:33:12,868 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:33:12,869 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:33:12,869 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:33:12,869 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:33:12,870 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:33:12" (1/1) ... [2025-03-16 19:33:12,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:33:12,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:33:12,894 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 19:33:12,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 19:33:12,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:33:12,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:33:12,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:33:12,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:33:13,023 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:33:13,025 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:33:13,603 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L664: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-16 19:33:13,603 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L619: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-16 19:33:13,603 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L574: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-03-16 19:33:13,603 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L477: havoc main_~node4__m4~2#1; [2025-03-16 19:33:13,603 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L462: havoc main_~node3__m3~2#1; [2025-03-16 19:33:13,603 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L710: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-16 19:33:13,603 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L529: havoc main_~node5____CPAchecker_TMP_0~1#1;havoc main_~node5__m5~2#1; [2025-03-16 19:33:13,603 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L447: havoc main_~node2__m2~2#1; [2025-03-16 19:33:13,604 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L431: 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_~node5__m5~1#1;havoc main_~node4__m4~1#1;havoc main_~node3__m3~1#1;havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1;havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1;havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-16 19:33:13,641 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2025-03-16 19:33:13,641 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:33:13,651 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:33:13,652 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:33:13,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:33:13 BoogieIcfgContainer [2025-03-16 19:33:13,652 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:33:13,655 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:33:13,655 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:33:13,658 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:33:13,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:33:12" (1/3) ... [2025-03-16 19:33:13,659 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54c80fd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:33:13, skipping insertion in model container [2025-03-16 19:33:13,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:33:12" (2/3) ... [2025-03-16 19:33:13,660 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54c80fd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:33:13, skipping insertion in model container [2025-03-16 19:33:13,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:33:13" (3/3) ... [2025-03-16 19:33:13,661 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2025-03-16 19:33:13,670 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:33:13,671 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c that has 1 procedures, 149 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-16 19:33:13,708 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:33:13,718 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;@668b626a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:33:13,719 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:33:13,722 INFO L276 IsEmpty]: Start isEmpty. Operand has 149 states, 147 states have (on average 1.7619047619047619) internal successors, (259), 148 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:13,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-16 19:33:13,728 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:13,729 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] [2025-03-16 19:33:13,729 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:13,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:13,734 INFO L85 PathProgramCache]: Analyzing trace with hash 98240387, now seen corresponding path program 1 times [2025-03-16 19:33:13,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:13,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449267346] [2025-03-16 19:33:13,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:13,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:13,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-16 19:33:13,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-16 19:33:13,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:13,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:14,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:14,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:14,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449267346] [2025-03-16 19:33:14,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449267346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:14,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:14,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:33:14,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968821632] [2025-03-16 19:33:14,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:14,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:33:14,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:14,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:33:14,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:33:14,280 INFO L87 Difference]: Start difference. First operand has 149 states, 147 states have (on average 1.7619047619047619) internal successors, (259), 148 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:14,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:14,628 INFO L93 Difference]: Finished difference Result 844 states and 1354 transitions. [2025-03-16 19:33:14,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:33:14,630 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-03-16 19:33:14,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:14,640 INFO L225 Difference]: With dead ends: 844 [2025-03-16 19:33:14,640 INFO L226 Difference]: Without dead ends: 750 [2025-03-16 19:33:14,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-03-16 19:33:14,648 INFO L435 NwaCegarLoop]: 604 mSDtfsCounter, 1364 mSDsluCounter, 2394 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1364 SdHoareTripleChecker+Valid, 2998 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:14,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1364 Valid, 2998 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:33:14,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2025-03-16 19:33:14,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 226. [2025-03-16 19:33:14,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 225 states have (on average 1.4533333333333334) internal successors, (327), 225 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:14,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 327 transitions. [2025-03-16 19:33:14,701 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 327 transitions. Word has length 75 [2025-03-16 19:33:14,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:14,702 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 327 transitions. [2025-03-16 19:33:14,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:14,702 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 327 transitions. [2025-03-16 19:33:14,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 19:33:14,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:14,705 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-16 19:33:14,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:33:14,706 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:14,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:14,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1969292257, now seen corresponding path program 1 times [2025-03-16 19:33:14,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:14,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448001900] [2025-03-16 19:33:14,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:14,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:14,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 19:33:14,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 19:33:14,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:14,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:14,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:14,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:14,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448001900] [2025-03-16 19:33:14,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448001900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:14,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:14,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:33:14,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351284337] [2025-03-16 19:33:14,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:14,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:33:14,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:14,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:33:14,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:33:14,937 INFO L87 Difference]: Start difference. First operand 226 states and 327 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 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-16 19:33:15,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:15,079 INFO L93 Difference]: Finished difference Result 921 states and 1418 transitions. [2025-03-16 19:33:15,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:33:15,080 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 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-16 19:33:15,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:15,083 INFO L225 Difference]: With dead ends: 921 [2025-03-16 19:33:15,083 INFO L226 Difference]: Without dead ends: 801 [2025-03-16 19:33:15,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:33:15,086 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 945 mSDsluCounter, 1045 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 945 SdHoareTripleChecker+Valid, 1617 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:15,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [945 Valid, 1617 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:33:15,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2025-03-16 19:33:15,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 360. [2025-03-16 19:33:15,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 1.501392757660167) internal successors, (539), 359 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:15,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 539 transitions. [2025-03-16 19:33:15,118 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 539 transitions. Word has length 77 [2025-03-16 19:33:15,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:15,119 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 539 transitions. [2025-03-16 19:33:15,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 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-16 19:33:15,119 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 539 transitions. [2025-03-16 19:33:15,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 19:33:15,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:15,120 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-16 19:33:15,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:33:15,121 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:15,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:15,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1648772903, now seen corresponding path program 1 times [2025-03-16 19:33:15,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:15,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740795730] [2025-03-16 19:33:15,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:15,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:15,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 19:33:15,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 19:33:15,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:15,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:15,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:15,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:15,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740795730] [2025-03-16 19:33:15,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740795730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:15,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:15,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:33:15,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405016565] [2025-03-16 19:33:15,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:15,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:33:15,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:15,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:33:15,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:33:15,307 INFO L87 Difference]: Start difference. First operand 360 states and 539 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 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-16 19:33:15,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:15,464 INFO L93 Difference]: Finished difference Result 1055 states and 1630 transitions. [2025-03-16 19:33:15,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:33:15,465 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 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-16 19:33:15,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:15,470 INFO L225 Difference]: With dead ends: 1055 [2025-03-16 19:33:15,470 INFO L226 Difference]: Without dead ends: 935 [2025-03-16 19:33:15,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:33:15,471 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 936 mSDsluCounter, 1001 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 1480 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:15,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [936 Valid, 1480 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:33:15,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2025-03-16 19:33:15,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 553. [2025-03-16 19:33:15,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 552 states have (on average 1.5289855072463767) internal successors, (844), 552 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:15,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 844 transitions. [2025-03-16 19:33:15,493 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 844 transitions. Word has length 77 [2025-03-16 19:33:15,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:15,493 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 844 transitions. [2025-03-16 19:33:15,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 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-16 19:33:15,495 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 844 transitions. [2025-03-16 19:33:15,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 19:33:15,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:15,496 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-16 19:33:15,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:33:15,496 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:15,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:15,498 INFO L85 PathProgramCache]: Analyzing trace with hash 735070759, now seen corresponding path program 1 times [2025-03-16 19:33:15,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:15,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545437586] [2025-03-16 19:33:15,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:15,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:15,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 19:33:15,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 19:33:15,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:15,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:15,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:15,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:15,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545437586] [2025-03-16 19:33:15,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545437586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:15,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:15,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:33:15,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514974161] [2025-03-16 19:33:15,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:15,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:33:15,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:15,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:33:15,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:33:15,687 INFO L87 Difference]: Start difference. First operand 553 states and 844 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 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-16 19:33:15,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:15,804 INFO L93 Difference]: Finished difference Result 1184 states and 1834 transitions. [2025-03-16 19:33:15,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:33:15,804 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 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-16 19:33:15,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:15,808 INFO L225 Difference]: With dead ends: 1184 [2025-03-16 19:33:15,808 INFO L226 Difference]: Without dead ends: 1064 [2025-03-16 19:33:15,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:33:15,809 INFO L435 NwaCegarLoop]: 378 mSDtfsCounter, 1108 mSDsluCounter, 882 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1108 SdHoareTripleChecker+Valid, 1260 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:15,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1108 Valid, 1260 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:33:15,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states. [2025-03-16 19:33:15,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 677. [2025-03-16 19:33:15,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 676 states have (on average 1.5384615384615385) internal successors, (1040), 676 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:15,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 1040 transitions. [2025-03-16 19:33:15,825 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 1040 transitions. Word has length 77 [2025-03-16 19:33:15,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:15,825 INFO L471 AbstractCegarLoop]: Abstraction has 677 states and 1040 transitions. [2025-03-16 19:33:15,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 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-16 19:33:15,826 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 1040 transitions. [2025-03-16 19:33:15,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 19:33:15,829 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:15,829 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-16 19:33:15,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:33:15,830 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:15,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:15,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1314982369, now seen corresponding path program 1 times [2025-03-16 19:33:15,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:15,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723530884] [2025-03-16 19:33:15,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:15,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:15,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 19:33:15,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 19:33:15,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:15,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:15,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:15,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:15,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723530884] [2025-03-16 19:33:15,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723530884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:15,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:15,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:33:15,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465875033] [2025-03-16 19:33:15,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:15,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:33:15,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:15,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:33:15,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:33:15,970 INFO L87 Difference]: Start difference. First operand 677 states and 1040 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 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-16 19:33:16,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:16,084 INFO L93 Difference]: Finished difference Result 1303 states and 2022 transitions. [2025-03-16 19:33:16,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:33:16,084 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 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-16 19:33:16,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:16,087 INFO L225 Difference]: With dead ends: 1303 [2025-03-16 19:33:16,087 INFO L226 Difference]: Without dead ends: 1183 [2025-03-16 19:33:16,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:33:16,088 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 1199 mSDsluCounter, 962 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1199 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:16,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1199 Valid, 1247 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:33:16,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2025-03-16 19:33:16,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 796. [2025-03-16 19:33:16,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 795 states have (on average 1.5446540880503146) internal successors, (1228), 795 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:16,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1228 transitions. [2025-03-16 19:33:16,105 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1228 transitions. Word has length 77 [2025-03-16 19:33:16,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:16,105 INFO L471 AbstractCegarLoop]: Abstraction has 796 states and 1228 transitions. [2025-03-16 19:33:16,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 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-16 19:33:16,105 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1228 transitions. [2025-03-16 19:33:16,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 19:33:16,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:16,106 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-16 19:33:16,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:33:16,106 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:16,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:16,107 INFO L85 PathProgramCache]: Analyzing trace with hash -41260244, now seen corresponding path program 1 times [2025-03-16 19:33:16,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:16,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890776767] [2025-03-16 19:33:16,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:16,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:16,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 19:33:16,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 19:33:16,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:16,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:16,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:16,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:16,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890776767] [2025-03-16 19:33:16,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890776767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:16,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:16,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:33:16,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106794941] [2025-03-16 19:33:16,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:16,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:33:16,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:16,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:33:16,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:33:16,168 INFO L87 Difference]: Start difference. First operand 796 states and 1228 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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-16 19:33:16,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:16,191 INFO L93 Difference]: Finished difference Result 2027 states and 3163 transitions. [2025-03-16 19:33:16,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:33:16,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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-16 19:33:16,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:16,196 INFO L225 Difference]: With dead ends: 2027 [2025-03-16 19:33:16,197 INFO L226 Difference]: Without dead ends: 1376 [2025-03-16 19:33:16,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:33:16,199 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 83 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:16,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 469 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:33:16,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2025-03-16 19:33:16,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 1374. [2025-03-16 19:33:16,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1374 states, 1373 states have (on average 1.5367807720320465) internal successors, (2110), 1373 states have internal predecessors, (2110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:16,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 2110 transitions. [2025-03-16 19:33:16,227 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 2110 transitions. Word has length 77 [2025-03-16 19:33:16,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:16,227 INFO L471 AbstractCegarLoop]: Abstraction has 1374 states and 2110 transitions. [2025-03-16 19:33:16,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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-16 19:33:16,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 2110 transitions. [2025-03-16 19:33:16,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 19:33:16,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:16,227 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-16 19:33:16,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:33:16,230 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:16,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:16,230 INFO L85 PathProgramCache]: Analyzing trace with hash -40098395, now seen corresponding path program 1 times [2025-03-16 19:33:16,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:16,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031169537] [2025-03-16 19:33:16,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:16,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:16,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 19:33:16,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 19:33:16,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:16,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:16,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:16,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:16,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031169537] [2025-03-16 19:33:16,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031169537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:16,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:16,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:33:16,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509978947] [2025-03-16 19:33:16,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:16,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:33:16,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:16,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:33:16,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:33:16,491 INFO L87 Difference]: Start difference. First operand 1374 states and 2110 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 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-16 19:33:16,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:16,645 INFO L93 Difference]: Finished difference Result 2605 states and 4023 transitions. [2025-03-16 19:33:16,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:33:16,646 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 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-16 19:33:16,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:16,649 INFO L225 Difference]: With dead ends: 2605 [2025-03-16 19:33:16,650 INFO L226 Difference]: Without dead ends: 1376 [2025-03-16 19:33:16,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-16 19:33:16,652 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 599 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:16,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 758 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:33:16,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2025-03-16 19:33:16,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 1374. [2025-03-16 19:33:16,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1374 states, 1373 states have (on average 1.5324107793153678) internal successors, (2104), 1373 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:16,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 2104 transitions. [2025-03-16 19:33:16,685 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 2104 transitions. Word has length 77 [2025-03-16 19:33:16,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:16,686 INFO L471 AbstractCegarLoop]: Abstraction has 1374 states and 2104 transitions. [2025-03-16 19:33:16,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 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-16 19:33:16,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 2104 transitions. [2025-03-16 19:33:16,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 19:33:16,686 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:16,687 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-16 19:33:16,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:33:16,687 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:16,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:16,687 INFO L85 PathProgramCache]: Analyzing trace with hash -567142113, now seen corresponding path program 1 times [2025-03-16 19:33:16,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:16,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119169481] [2025-03-16 19:33:16,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:16,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:16,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 19:33:16,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 19:33:16,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:16,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:16,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:16,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:16,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119169481] [2025-03-16 19:33:16,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119169481] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:16,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:16,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:33:16,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370187302] [2025-03-16 19:33:16,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:16,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:33:16,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:16,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:33:16,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:33:16,812 INFO L87 Difference]: Start difference. First operand 1374 states and 2104 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 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-16 19:33:16,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:16,950 INFO L93 Difference]: Finished difference Result 2530 states and 3894 transitions. [2025-03-16 19:33:16,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:33:16,950 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 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-16 19:33:16,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:16,957 INFO L225 Difference]: With dead ends: 2530 [2025-03-16 19:33:16,957 INFO L226 Difference]: Without dead ends: 2305 [2025-03-16 19:33:16,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:33:16,959 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 1079 mSDsluCounter, 1297 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1079 SdHoareTripleChecker+Valid, 1600 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:16,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1079 Valid, 1600 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:33:16,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2305 states. [2025-03-16 19:33:16,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2305 to 1608. [2025-03-16 19:33:16,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1608 states, 1607 states have (on average 1.5351586807716242) internal successors, (2467), 1607 states have internal predecessors, (2467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:16,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 2467 transitions. [2025-03-16 19:33:16,996 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 2467 transitions. Word has length 77 [2025-03-16 19:33:16,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:16,996 INFO L471 AbstractCegarLoop]: Abstraction has 1608 states and 2467 transitions. [2025-03-16 19:33:16,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 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-16 19:33:16,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 2467 transitions. [2025-03-16 19:33:16,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 19:33:16,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:16,999 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:33:16,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:33:16,999 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:17,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:17,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1274295045, now seen corresponding path program 1 times [2025-03-16 19:33:17,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:17,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138728292] [2025-03-16 19:33:17,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:17,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:17,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 19:33:17,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 19:33:17,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:17,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:17,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:17,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:17,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138728292] [2025-03-16 19:33:17,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138728292] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:17,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:17,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:33:17,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70630485] [2025-03-16 19:33:17,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:17,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:33:17,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:17,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:33:17,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:33:17,092 INFO L87 Difference]: Start difference. First operand 1608 states and 2467 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:17,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:17,252 INFO L93 Difference]: Finished difference Result 4697 states and 7250 transitions. [2025-03-16 19:33:17,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:33:17,253 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-16 19:33:17,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:17,261 INFO L225 Difference]: With dead ends: 4697 [2025-03-16 19:33:17,261 INFO L226 Difference]: Without dead ends: 3126 [2025-03-16 19:33:17,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:33:17,267 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 810 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 810 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:17,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [810 Valid, 177 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:33:17,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3126 states. [2025-03-16 19:33:17,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3126 to 3124. [2025-03-16 19:33:17,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3124 states, 3123 states have (on average 1.5347422350304194) internal successors, (4793), 3123 states have internal predecessors, (4793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:17,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 4793 transitions. [2025-03-16 19:33:17,322 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 4793 transitions. Word has length 78 [2025-03-16 19:33:17,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:17,322 INFO L471 AbstractCegarLoop]: Abstraction has 3124 states and 4793 transitions. [2025-03-16 19:33:17,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:17,322 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 4793 transitions. [2025-03-16 19:33:17,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 19:33:17,324 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:17,324 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:33:17,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:33:17,325 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:17,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:17,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1273751423, now seen corresponding path program 1 times [2025-03-16 19:33:17,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:17,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80514311] [2025-03-16 19:33:17,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:17,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:17,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 19:33:17,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 19:33:17,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:17,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:17,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:17,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:17,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80514311] [2025-03-16 19:33:17,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80514311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:17,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:17,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:33:17,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326468162] [2025-03-16 19:33:17,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:17,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:33:17,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:17,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:33:17,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:33:17,413 INFO L87 Difference]: Start difference. First operand 3124 states and 4793 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:17,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:17,545 INFO L93 Difference]: Finished difference Result 6199 states and 9534 transitions. [2025-03-16 19:33:17,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:33:17,546 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-03-16 19:33:17,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:17,554 INFO L225 Difference]: With dead ends: 6199 [2025-03-16 19:33:17,554 INFO L226 Difference]: Without dead ends: 3124 [2025-03-16 19:33:17,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:33:17,558 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 517 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:17,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 133 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:33:17,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3124 states. [2025-03-16 19:33:17,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3124 to 3124. [2025-03-16 19:33:17,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3124 states, 3123 states have (on average 1.5177713736791547) internal successors, (4740), 3123 states have internal predecessors, (4740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:17,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 4740 transitions. [2025-03-16 19:33:17,608 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 4740 transitions. Word has length 79 [2025-03-16 19:33:17,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:17,608 INFO L471 AbstractCegarLoop]: Abstraction has 3124 states and 4740 transitions. [2025-03-16 19:33:17,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:17,609 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 4740 transitions. [2025-03-16 19:33:17,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-16 19:33:17,610 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:17,610 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:33:17,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:33:17,610 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:17,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:17,610 INFO L85 PathProgramCache]: Analyzing trace with hash -508108961, now seen corresponding path program 1 times [2025-03-16 19:33:17,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:17,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093086933] [2025-03-16 19:33:17,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:17,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:17,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-16 19:33:17,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-16 19:33:17,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:17,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:17,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:17,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:17,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093086933] [2025-03-16 19:33:17,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093086933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:17,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:17,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:33:17,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938822665] [2025-03-16 19:33:17,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:17,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:33:17,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:17,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:33:17,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:33:17,692 INFO L87 Difference]: Start difference. First operand 3124 states and 4740 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:17,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:17,797 INFO L93 Difference]: Finished difference Result 6195 states and 9424 transitions. [2025-03-16 19:33:17,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:33:17,797 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-03-16 19:33:17,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:17,805 INFO L225 Difference]: With dead ends: 6195 [2025-03-16 19:33:17,805 INFO L226 Difference]: Without dead ends: 3124 [2025-03-16 19:33:17,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:33:17,810 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 499 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:17,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 141 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:33:17,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3124 states. [2025-03-16 19:33:17,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3124 to 3124. [2025-03-16 19:33:17,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3124 states, 3123 states have (on average 1.5008005123278898) internal successors, (4687), 3123 states have internal predecessors, (4687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:17,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 4687 transitions. [2025-03-16 19:33:17,883 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 4687 transitions. Word has length 80 [2025-03-16 19:33:17,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:17,883 INFO L471 AbstractCegarLoop]: Abstraction has 3124 states and 4687 transitions. [2025-03-16 19:33:17,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:17,884 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 4687 transitions. [2025-03-16 19:33:17,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:33:17,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:17,885 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:33:17,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:33:17,885 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:17,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:17,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1690392477, now seen corresponding path program 1 times [2025-03-16 19:33:17,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:17,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660748321] [2025-03-16 19:33:17,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:17,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:17,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:33:17,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:33:17,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:17,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:17,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:17,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:17,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660748321] [2025-03-16 19:33:17,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660748321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:17,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:17,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:33:17,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205446721] [2025-03-16 19:33:17,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:17,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:33:17,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:17,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:33:17,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:33:17,975 INFO L87 Difference]: Start difference. First operand 3124 states and 4687 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:18,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:18,082 INFO L93 Difference]: Finished difference Result 6207 states and 9332 transitions. [2025-03-16 19:33:18,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:33:18,083 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-03-16 19:33:18,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:18,090 INFO L225 Difference]: With dead ends: 6207 [2025-03-16 19:33:18,090 INFO L226 Difference]: Without dead ends: 3124 [2025-03-16 19:33:18,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:33:18,094 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 527 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:18,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 117 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:33:18,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3124 states. [2025-03-16 19:33:18,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3124 to 3124. [2025-03-16 19:33:18,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3124 states, 3123 states have (on average 1.4838296509766251) internal successors, (4634), 3123 states have internal predecessors, (4634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:18,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 4634 transitions. [2025-03-16 19:33:18,137 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 4634 transitions. Word has length 81 [2025-03-16 19:33:18,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:18,138 INFO L471 AbstractCegarLoop]: Abstraction has 3124 states and 4634 transitions. [2025-03-16 19:33:18,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:18,138 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 4634 transitions. [2025-03-16 19:33:18,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 19:33:18,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:18,139 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:33:18,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:33:18,139 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:18,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:18,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1745174907, now seen corresponding path program 1 times [2025-03-16 19:33:18,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:18,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805156854] [2025-03-16 19:33:18,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:18,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:18,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 19:33:18,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 19:33:18,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:18,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:18,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:18,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:18,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805156854] [2025-03-16 19:33:18,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805156854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:18,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:18,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:33:18,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887092475] [2025-03-16 19:33:18,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:18,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:33:18,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:18,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:33:18,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:33:18,213 INFO L87 Difference]: Start difference. First operand 3124 states and 4634 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:18,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:18,338 INFO L93 Difference]: Finished difference Result 6203 states and 9222 transitions. [2025-03-16 19:33:18,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:33:18,338 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-03-16 19:33:18,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:18,348 INFO L225 Difference]: With dead ends: 6203 [2025-03-16 19:33:18,351 INFO L226 Difference]: Without dead ends: 3124 [2025-03-16 19:33:18,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:33:18,354 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 509 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:18,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 125 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:33:18,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3124 states. [2025-03-16 19:33:18,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3124 to 3124. [2025-03-16 19:33:18,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3124 states, 3123 states have (on average 1.4668587896253602) internal successors, (4581), 3123 states have internal predecessors, (4581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:18,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 4581 transitions. [2025-03-16 19:33:18,396 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 4581 transitions. Word has length 82 [2025-03-16 19:33:18,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:18,396 INFO L471 AbstractCegarLoop]: Abstraction has 3124 states and 4581 transitions. [2025-03-16 19:33:18,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:18,396 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 4581 transitions. [2025-03-16 19:33:18,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-16 19:33:18,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:18,397 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:33:18,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:33:18,397 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:18,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:18,398 INFO L85 PathProgramCache]: Analyzing trace with hash -182986055, now seen corresponding path program 1 times [2025-03-16 19:33:18,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:18,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983590760] [2025-03-16 19:33:18,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:18,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:18,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-16 19:33:18,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-16 19:33:18,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:18,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:18,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:18,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:18,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983590760] [2025-03-16 19:33:18,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983590760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:18,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:18,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:33:18,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056140404] [2025-03-16 19:33:18,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:18,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:33:18,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:18,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:33:18,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:33:18,514 INFO L87 Difference]: Start difference. First operand 3124 states and 4581 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:18,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:18,539 INFO L93 Difference]: Finished difference Result 7313 states and 10749 transitions. [2025-03-16 19:33:18,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:33:18,540 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-03-16 19:33:18,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:18,547 INFO L225 Difference]: With dead ends: 7313 [2025-03-16 19:33:18,548 INFO L226 Difference]: Without dead ends: 4411 [2025-03-16 19:33:18,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:33:18,553 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 103 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:18,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 451 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:33:18,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4411 states. [2025-03-16 19:33:18,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4411 to 4409. [2025-03-16 19:33:18,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4409 states, 4408 states have (on average 1.4614337568058076) internal successors, (6442), 4408 states have internal predecessors, (6442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:18,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4409 states to 4409 states and 6442 transitions. [2025-03-16 19:33:18,640 INFO L78 Accepts]: Start accepts. Automaton has 4409 states and 6442 transitions. Word has length 83 [2025-03-16 19:33:18,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:18,640 INFO L471 AbstractCegarLoop]: Abstraction has 4409 states and 6442 transitions. [2025-03-16 19:33:18,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:18,640 INFO L276 IsEmpty]: Start isEmpty. Operand 4409 states and 6442 transitions. [2025-03-16 19:33:18,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-16 19:33:18,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:18,641 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:33:18,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:33:18,641 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:18,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:18,642 INFO L85 PathProgramCache]: Analyzing trace with hash -150781984, now seen corresponding path program 1 times [2025-03-16 19:33:18,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:18,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421526074] [2025-03-16 19:33:18,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:18,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:18,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-16 19:33:18,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-16 19:33:18,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:18,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:18,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:18,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:18,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421526074] [2025-03-16 19:33:18,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421526074] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:18,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:18,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:33:18,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465343894] [2025-03-16 19:33:18,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:18,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:33:18,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:18,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:33:18,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:33:18,859 INFO L87 Difference]: Start difference. First operand 4409 states and 6442 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:19,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:19,174 INFO L93 Difference]: Finished difference Result 12164 states and 17802 transitions. [2025-03-16 19:33:19,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:33:19,175 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-03-16 19:33:19,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:19,187 INFO L225 Difference]: With dead ends: 12164 [2025-03-16 19:33:19,188 INFO L226 Difference]: Without dead ends: 8607 [2025-03-16 19:33:19,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-03-16 19:33:19,193 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 698 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:19,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 453 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:33:19,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8607 states. [2025-03-16 19:33:19,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8607 to 4409. [2025-03-16 19:33:19,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4409 states, 4408 states have (on average 1.4612068965517242) internal successors, (6441), 4408 states have internal predecessors, (6441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:19,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4409 states to 4409 states and 6441 transitions. [2025-03-16 19:33:19,274 INFO L78 Accepts]: Start accepts. Automaton has 4409 states and 6441 transitions. Word has length 83 [2025-03-16 19:33:19,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:19,274 INFO L471 AbstractCegarLoop]: Abstraction has 4409 states and 6441 transitions. [2025-03-16 19:33:19,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:19,274 INFO L276 IsEmpty]: Start isEmpty. Operand 4409 states and 6441 transitions. [2025-03-16 19:33:19,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-16 19:33:19,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:19,275 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:33:19,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:33:19,275 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:19,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:19,276 INFO L85 PathProgramCache]: Analyzing trace with hash -929585299, now seen corresponding path program 1 times [2025-03-16 19:33:19,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:19,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904334364] [2025-03-16 19:33:19,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:19,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:19,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-16 19:33:19,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-16 19:33:19,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:19,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:19,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:19,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:19,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904334364] [2025-03-16 19:33:19,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904334364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:19,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:19,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:33:19,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163570142] [2025-03-16 19:33:19,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:19,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:33:19,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:19,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:33:19,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:33:19,474 INFO L87 Difference]: Start difference. First operand 4409 states and 6441 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:19,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:19,509 INFO L93 Difference]: Finished difference Result 4435 states and 6478 transitions. [2025-03-16 19:33:19,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:33:19,509 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-03-16 19:33:19,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:19,515 INFO L225 Difference]: With dead ends: 4435 [2025-03-16 19:33:19,516 INFO L226 Difference]: Without dead ends: 4433 [2025-03-16 19:33:19,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:33:19,517 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 0 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:19,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 737 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:33:19,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4433 states. [2025-03-16 19:33:19,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4433 to 4433. [2025-03-16 19:33:19,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4433 states, 4432 states have (on average 1.4526173285198556) internal successors, (6438), 4432 states have internal predecessors, (6438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:19,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4433 states to 4433 states and 6438 transitions. [2025-03-16 19:33:19,581 INFO L78 Accepts]: Start accepts. Automaton has 4433 states and 6438 transitions. Word has length 84 [2025-03-16 19:33:19,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:19,582 INFO L471 AbstractCegarLoop]: Abstraction has 4433 states and 6438 transitions. [2025-03-16 19:33:19,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:19,582 INFO L276 IsEmpty]: Start isEmpty. Operand 4433 states and 6438 transitions. [2025-03-16 19:33:19,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-16 19:33:19,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:19,583 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:33:19,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:33:19,583 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:19,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:19,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1504366907, now seen corresponding path program 1 times [2025-03-16 19:33:19,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:19,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58855705] [2025-03-16 19:33:19,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:19,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:19,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-16 19:33:19,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-16 19:33:19,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:19,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:19,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:19,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:19,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58855705] [2025-03-16 19:33:19,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58855705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:19,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:19,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:33:19,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373404745] [2025-03-16 19:33:19,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:19,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:33:19,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:19,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:33:19,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:33:19,817 INFO L87 Difference]: Start difference. First operand 4433 states and 6438 transitions. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:20,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:20,208 INFO L93 Difference]: Finished difference Result 13149 states and 19058 transitions. [2025-03-16 19:33:20,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:33:20,209 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-03-16 19:33:20,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:20,222 INFO L225 Difference]: With dead ends: 13149 [2025-03-16 19:33:20,223 INFO L226 Difference]: Without dead ends: 8882 [2025-03-16 19:33:20,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-03-16 19:33:20,231 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 794 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:20,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 503 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:33:20,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8882 states. [2025-03-16 19:33:20,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8882 to 4433. [2025-03-16 19:33:20,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4433 states, 4432 states have (on average 1.450586642599278) internal successors, (6429), 4432 states have internal predecessors, (6429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:20,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4433 states to 4433 states and 6429 transitions. [2025-03-16 19:33:20,305 INFO L78 Accepts]: Start accepts. Automaton has 4433 states and 6429 transitions. Word has length 84 [2025-03-16 19:33:20,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:20,305 INFO L471 AbstractCegarLoop]: Abstraction has 4433 states and 6429 transitions. [2025-03-16 19:33:20,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:20,306 INFO L276 IsEmpty]: Start isEmpty. Operand 4433 states and 6429 transitions. [2025-03-16 19:33:20,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-16 19:33:20,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:20,307 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:33:20,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:33:20,307 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:20,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:20,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1876898245, now seen corresponding path program 1 times [2025-03-16 19:33:20,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:20,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005708835] [2025-03-16 19:33:20,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:20,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:20,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-16 19:33:20,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-16 19:33:20,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:20,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:20,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:20,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:20,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005708835] [2025-03-16 19:33:20,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005708835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:20,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:20,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:33:20,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755320043] [2025-03-16 19:33:20,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:20,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:33:20,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:20,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:33:20,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:33:20,519 INFO L87 Difference]: Start difference. First operand 4433 states and 6429 transitions. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:21,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:21,042 INFO L93 Difference]: Finished difference Result 9438 states and 13655 transitions. [2025-03-16 19:33:21,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:33:21,042 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-03-16 19:33:21,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:21,049 INFO L225 Difference]: With dead ends: 9438 [2025-03-16 19:33:21,049 INFO L226 Difference]: Without dead ends: 5126 [2025-03-16 19:33:21,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2025-03-16 19:33:21,053 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 589 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:21,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 819 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:33:21,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5126 states. [2025-03-16 19:33:21,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5126 to 4433. [2025-03-16 19:33:21,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4433 states, 4432 states have (on average 1.4499097472924187) internal successors, (6426), 4432 states have internal predecessors, (6426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:21,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4433 states to 4433 states and 6426 transitions. [2025-03-16 19:33:21,098 INFO L78 Accepts]: Start accepts. Automaton has 4433 states and 6426 transitions. Word has length 84 [2025-03-16 19:33:21,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:21,098 INFO L471 AbstractCegarLoop]: Abstraction has 4433 states and 6426 transitions. [2025-03-16 19:33:21,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:21,098 INFO L276 IsEmpty]: Start isEmpty. Operand 4433 states and 6426 transitions. [2025-03-16 19:33:21,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-16 19:33:21,099 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:21,099 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:33:21,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:33:21,100 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:21,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:21,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1540908256, now seen corresponding path program 1 times [2025-03-16 19:33:21,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:21,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261827697] [2025-03-16 19:33:21,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:21,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:21,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 19:33:21,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 19:33:21,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:21,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:21,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:21,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:21,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261827697] [2025-03-16 19:33:21,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261827697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:21,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:21,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:33:21,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413164677] [2025-03-16 19:33:21,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:21,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:33:21,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:21,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:33:21,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:33:21,284 INFO L87 Difference]: Start difference. First operand 4433 states and 6426 transitions. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:21,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:21,654 INFO L93 Difference]: Finished difference Result 13074 states and 18926 transitions. [2025-03-16 19:33:21,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:33:21,655 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-03-16 19:33:21,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:21,668 INFO L225 Difference]: With dead ends: 13074 [2025-03-16 19:33:21,668 INFO L226 Difference]: Without dead ends: 8852 [2025-03-16 19:33:21,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-03-16 19:33:21,674 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 474 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:21,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 534 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:33:21,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8852 states. [2025-03-16 19:33:21,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8852 to 4433. [2025-03-16 19:33:21,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4433 states, 4432 states have (on average 1.447427797833935) internal successors, (6415), 4432 states have internal predecessors, (6415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:21,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4433 states to 4433 states and 6415 transitions. [2025-03-16 19:33:21,738 INFO L78 Accepts]: Start accepts. Automaton has 4433 states and 6415 transitions. Word has length 85 [2025-03-16 19:33:21,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:21,738 INFO L471 AbstractCegarLoop]: Abstraction has 4433 states and 6415 transitions. [2025-03-16 19:33:21,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:21,739 INFO L276 IsEmpty]: Start isEmpty. Operand 4433 states and 6415 transitions. [2025-03-16 19:33:21,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 19:33:21,739 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:21,739 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:33:21,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 19:33:21,740 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:21,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:21,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1884125517, now seen corresponding path program 1 times [2025-03-16 19:33:21,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:21,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337188360] [2025-03-16 19:33:21,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:21,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:21,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 19:33:21,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 19:33:21,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:21,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:22,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:22,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:22,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337188360] [2025-03-16 19:33:22,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337188360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:22,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:22,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 19:33:22,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070876884] [2025-03-16 19:33:22,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:22,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 19:33:22,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:22,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 19:33:22,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:33:22,194 INFO L87 Difference]: Start difference. First operand 4433 states and 6415 transitions. Second operand has 12 states, 12 states have (on average 7.166666666666667) internal successors, (86), 11 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:23,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:23,128 INFO L93 Difference]: Finished difference Result 23770 states and 34211 transitions. [2025-03-16 19:33:23,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-16 19:33:23,128 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.166666666666667) internal successors, (86), 11 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-03-16 19:33:23,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:23,155 INFO L225 Difference]: With dead ends: 23770 [2025-03-16 19:33:23,155 INFO L226 Difference]: Without dead ends: 19473 [2025-03-16 19:33:23,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=197, Invalid=559, Unknown=0, NotChecked=0, Total=756 [2025-03-16 19:33:23,163 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 1553 mSDsluCounter, 1029 mSDsCounter, 0 mSdLazyCounter, 1152 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1553 SdHoareTripleChecker+Valid, 1219 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:23,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1553 Valid, 1219 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1152 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 19:33:23,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19473 states. [2025-03-16 19:33:23,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19473 to 4442. [2025-03-16 19:33:23,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4442 states, 4441 states have (on average 1.4458455302859716) internal successors, (6421), 4441 states have internal predecessors, (6421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:23,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4442 states to 4442 states and 6421 transitions. [2025-03-16 19:33:23,278 INFO L78 Accepts]: Start accepts. Automaton has 4442 states and 6421 transitions. Word has length 86 [2025-03-16 19:33:23,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:23,278 INFO L471 AbstractCegarLoop]: Abstraction has 4442 states and 6421 transitions. [2025-03-16 19:33:23,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.166666666666667) internal successors, (86), 11 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:23,278 INFO L276 IsEmpty]: Start isEmpty. Operand 4442 states and 6421 transitions. [2025-03-16 19:33:23,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-16 19:33:23,279 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:23,279 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:33:23,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 19:33:23,280 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:23,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:23,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1119610448, now seen corresponding path program 1 times [2025-03-16 19:33:23,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:23,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460054555] [2025-03-16 19:33:23,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:23,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:23,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-16 19:33:23,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-16 19:33:23,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:23,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:25,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:25,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:25,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460054555] [2025-03-16 19:33:25,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460054555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:25,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:25,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2025-03-16 19:33:25,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819914391] [2025-03-16 19:33:25,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:25,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-16 19:33:25,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:25,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-16 19:33:25,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=800, Unknown=0, NotChecked=0, Total=870 [2025-03-16 19:33:25,172 INFO L87 Difference]: Start difference. First operand 4442 states and 6421 transitions. Second operand has 30 states, 30 states have (on average 2.9) internal successors, (87), 29 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:28,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:28,985 INFO L93 Difference]: Finished difference Result 8198 states and 11867 transitions. [2025-03-16 19:33:28,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-16 19:33:28,985 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.9) internal successors, (87), 29 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2025-03-16 19:33:28,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:28,992 INFO L225 Difference]: With dead ends: 8198 [2025-03-16 19:33:28,992 INFO L226 Difference]: Without dead ends: 7080 [2025-03-16 19:33:28,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=412, Invalid=2450, Unknown=0, NotChecked=0, Total=2862 [2025-03-16 19:33:28,996 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 1793 mSDsluCounter, 6857 mSDsCounter, 0 mSdLazyCounter, 4596 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1793 SdHoareTripleChecker+Valid, 7277 SdHoareTripleChecker+Invalid, 4597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:28,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1793 Valid, 7277 Invalid, 4597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4596 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 19:33:29,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7080 states. [2025-03-16 19:33:29,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7080 to 4474. [2025-03-16 19:33:29,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4474 states, 4473 states have (on average 1.444891571652135) internal successors, (6463), 4473 states have internal predecessors, (6463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:29,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4474 states to 4474 states and 6463 transitions. [2025-03-16 19:33:29,050 INFO L78 Accepts]: Start accepts. Automaton has 4474 states and 6463 transitions. Word has length 87 [2025-03-16 19:33:29,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:29,050 INFO L471 AbstractCegarLoop]: Abstraction has 4474 states and 6463 transitions. [2025-03-16 19:33:29,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.9) internal successors, (87), 29 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:29,050 INFO L276 IsEmpty]: Start isEmpty. Operand 4474 states and 6463 transitions. [2025-03-16 19:33:29,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-16 19:33:29,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:29,051 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:33:29,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 19:33:29,052 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:29,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:29,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1202082480, now seen corresponding path program 1 times [2025-03-16 19:33:29,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:29,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2249431] [2025-03-16 19:33:29,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:29,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:29,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-16 19:33:29,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-16 19:33:29,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:29,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:30,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:30,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:30,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2249431] [2025-03-16 19:33:30,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2249431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:30,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:30,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2025-03-16 19:33:30,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770614990] [2025-03-16 19:33:30,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:30,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-16 19:33:30,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:30,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-16 19:33:30,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=898, Unknown=0, NotChecked=0, Total=992 [2025-03-16 19:33:30,309 INFO L87 Difference]: Start difference. First operand 4474 states and 6463 transitions. Second operand has 32 states, 32 states have (on average 2.71875) internal successors, (87), 32 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:33,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:33,807 INFO L93 Difference]: Finished difference Result 8886 states and 12857 transitions. [2025-03-16 19:33:33,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-16 19:33:33,807 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.71875) internal successors, (87), 32 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2025-03-16 19:33:33,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:33,815 INFO L225 Difference]: With dead ends: 8886 [2025-03-16 19:33:33,815 INFO L226 Difference]: Without dead ends: 7768 [2025-03-16 19:33:33,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=490, Invalid=2932, Unknown=0, NotChecked=0, Total=3422 [2025-03-16 19:33:33,819 INFO L435 NwaCegarLoop]: 519 mSDtfsCounter, 1347 mSDsluCounter, 8450 mSDsCounter, 0 mSdLazyCounter, 5936 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1347 SdHoareTripleChecker+Valid, 8969 SdHoareTripleChecker+Invalid, 5939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:33,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1347 Valid, 8969 Invalid, 5939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5936 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-16 19:33:33,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7768 states. [2025-03-16 19:33:33,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7768 to 4474. [2025-03-16 19:33:33,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4474 states, 4473 states have (on average 1.4444444444444444) internal successors, (6461), 4473 states have internal predecessors, (6461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:33,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4474 states to 4474 states and 6461 transitions. [2025-03-16 19:33:33,876 INFO L78 Accepts]: Start accepts. Automaton has 4474 states and 6461 transitions. Word has length 87 [2025-03-16 19:33:33,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:33,876 INFO L471 AbstractCegarLoop]: Abstraction has 4474 states and 6461 transitions. [2025-03-16 19:33:33,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.71875) internal successors, (87), 32 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:33,876 INFO L276 IsEmpty]: Start isEmpty. Operand 4474 states and 6461 transitions. [2025-03-16 19:33:33,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-16 19:33:33,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:33,877 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:33:33,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 19:33:33,878 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:33,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:33,878 INFO L85 PathProgramCache]: Analyzing trace with hash 124677792, now seen corresponding path program 1 times [2025-03-16 19:33:33,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:33,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773463740] [2025-03-16 19:33:33,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:33,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:33,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-16 19:33:33,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-16 19:33:33,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:33,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:34,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:34,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:34,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773463740] [2025-03-16 19:33:34,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773463740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:34,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:34,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-16 19:33:34,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897401171] [2025-03-16 19:33:34,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:34,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 19:33:34,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:34,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 19:33:34,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-16 19:33:34,321 INFO L87 Difference]: Start difference. First operand 4474 states and 6461 transitions. Second operand has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:34,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:34,865 INFO L93 Difference]: Finished difference Result 11237 states and 16291 transitions. [2025-03-16 19:33:34,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 19:33:34,866 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2025-03-16 19:33:34,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:34,876 INFO L225 Difference]: With dead ends: 11237 [2025-03-16 19:33:34,876 INFO L226 Difference]: Without dead ends: 9848 [2025-03-16 19:33:34,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2025-03-16 19:33:34,879 INFO L435 NwaCegarLoop]: 389 mSDtfsCounter, 690 mSDsluCounter, 2498 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 2887 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:34,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 2887 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:33:34,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9848 states. [2025-03-16 19:33:34,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9848 to 4432. [2025-03-16 19:33:34,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4432 states, 4431 states have (on average 1.4443692168810651) internal successors, (6400), 4431 states have internal predecessors, (6400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:34,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4432 states to 4432 states and 6400 transitions. [2025-03-16 19:33:34,937 INFO L78 Accepts]: Start accepts. Automaton has 4432 states and 6400 transitions. Word has length 87 [2025-03-16 19:33:34,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:34,938 INFO L471 AbstractCegarLoop]: Abstraction has 4432 states and 6400 transitions. [2025-03-16 19:33:34,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:34,938 INFO L276 IsEmpty]: Start isEmpty. Operand 4432 states and 6400 transitions. [2025-03-16 19:33:34,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-16 19:33:34,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:34,939 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:33:34,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 19:33:34,939 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:34,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:34,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1291721978, now seen corresponding path program 1 times [2025-03-16 19:33:34,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:34,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171296222] [2025-03-16 19:33:34,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:34,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:34,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-16 19:33:34,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-16 19:33:34,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:34,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:35,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:35,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:35,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171296222] [2025-03-16 19:33:35,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171296222] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:35,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:35,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:33:35,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863504395] [2025-03-16 19:33:35,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:35,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:33:35,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:35,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:33:35,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:33:35,113 INFO L87 Difference]: Start difference. First operand 4432 states and 6400 transitions. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:35,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:35,512 INFO L93 Difference]: Finished difference Result 13140 states and 18988 transitions. [2025-03-16 19:33:35,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:33:35,513 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2025-03-16 19:33:35,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:35,522 INFO L225 Difference]: With dead ends: 13140 [2025-03-16 19:33:35,522 INFO L226 Difference]: Without dead ends: 8875 [2025-03-16 19:33:35,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-03-16 19:33:35,528 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 569 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:35,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 800 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:33:35,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8875 states. [2025-03-16 19:33:35,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8875 to 4426. [2025-03-16 19:33:35,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4426 states, 4425 states have (on average 1.4442937853107345) internal successors, (6391), 4425 states have internal predecessors, (6391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:35,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4426 states to 4426 states and 6391 transitions. [2025-03-16 19:33:35,595 INFO L78 Accepts]: Start accepts. Automaton has 4426 states and 6391 transitions. Word has length 87 [2025-03-16 19:33:35,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:35,595 INFO L471 AbstractCegarLoop]: Abstraction has 4426 states and 6391 transitions. [2025-03-16 19:33:35,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:35,595 INFO L276 IsEmpty]: Start isEmpty. Operand 4426 states and 6391 transitions. [2025-03-16 19:33:35,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-16 19:33:35,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:35,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:33:35,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 19:33:35,596 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:35,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:35,597 INFO L85 PathProgramCache]: Analyzing trace with hash 270841032, now seen corresponding path program 1 times [2025-03-16 19:33:35,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:35,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449526797] [2025-03-16 19:33:35,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:35,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:35,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-16 19:33:35,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-16 19:33:35,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:35,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:36,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:36,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:36,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449526797] [2025-03-16 19:33:36,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449526797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:36,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:36,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-16 19:33:36,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475343396] [2025-03-16 19:33:36,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:36,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-16 19:33:36,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:36,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-16 19:33:36,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:33:36,312 INFO L87 Difference]: Start difference. First operand 4426 states and 6391 transitions. Second operand has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 16 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:37,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:37,217 INFO L93 Difference]: Finished difference Result 6802 states and 9841 transitions. [2025-03-16 19:33:37,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 19:33:37,217 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 16 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2025-03-16 19:33:37,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:37,225 INFO L225 Difference]: With dead ends: 6802 [2025-03-16 19:33:37,225 INFO L226 Difference]: Without dead ends: 5659 [2025-03-16 19:33:37,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=211, Invalid=659, Unknown=0, NotChecked=0, Total=870 [2025-03-16 19:33:37,228 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 1064 mSDsluCounter, 2344 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1064 SdHoareTripleChecker+Valid, 2593 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:37,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1064 Valid, 2593 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 808 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:33:37,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5659 states. [2025-03-16 19:33:37,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5659 to 4426. [2025-03-16 19:33:37,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4426 states, 4425 states have (on average 1.4440677966101696) internal successors, (6390), 4425 states have internal predecessors, (6390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:37,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4426 states to 4426 states and 6390 transitions. [2025-03-16 19:33:37,272 INFO L78 Accepts]: Start accepts. Automaton has 4426 states and 6390 transitions. Word has length 87 [2025-03-16 19:33:37,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:37,272 INFO L471 AbstractCegarLoop]: Abstraction has 4426 states and 6390 transitions. [2025-03-16 19:33:37,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 16 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:37,272 INFO L276 IsEmpty]: Start isEmpty. Operand 4426 states and 6390 transitions. [2025-03-16 19:33:37,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-16 19:33:37,273 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:37,273 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:33:37,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 19:33:37,273 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:37,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:37,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1461052413, now seen corresponding path program 1 times [2025-03-16 19:33:37,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:37,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687502448] [2025-03-16 19:33:37,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:37,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:37,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-16 19:33:37,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-16 19:33:37,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:37,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:37,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:37,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:37,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687502448] [2025-03-16 19:33:37,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687502448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:37,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:37,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 19:33:37,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740911064] [2025-03-16 19:33:37,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:37,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 19:33:37,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:37,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 19:33:37,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:33:37,661 INFO L87 Difference]: Start difference. First operand 4426 states and 6390 transitions. Second operand has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:38,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:38,080 INFO L93 Difference]: Finished difference Result 10017 states and 14522 transitions. [2025-03-16 19:33:38,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 19:33:38,081 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2025-03-16 19:33:38,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:38,088 INFO L225 Difference]: With dead ends: 10017 [2025-03-16 19:33:38,088 INFO L226 Difference]: Without dead ends: 8633 [2025-03-16 19:33:38,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-03-16 19:33:38,091 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 822 mSDsluCounter, 1415 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 1667 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:38,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 1667 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:33:38,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8633 states. [2025-03-16 19:33:38,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8633 to 4378. [2025-03-16 19:33:38,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4378 states, 4377 states have (on average 1.4445967557687913) internal successors, (6323), 4377 states have internal predecessors, (6323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:38,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4378 states to 4378 states and 6323 transitions. [2025-03-16 19:33:38,143 INFO L78 Accepts]: Start accepts. Automaton has 4378 states and 6323 transitions. Word has length 88 [2025-03-16 19:33:38,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:38,143 INFO L471 AbstractCegarLoop]: Abstraction has 4378 states and 6323 transitions. [2025-03-16 19:33:38,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:38,143 INFO L276 IsEmpty]: Start isEmpty. Operand 4378 states and 6323 transitions. [2025-03-16 19:33:38,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-16 19:33:38,144 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:38,144 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:33:38,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-16 19:33:38,144 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:38,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:38,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1674715541, now seen corresponding path program 1 times [2025-03-16 19:33:38,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:38,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579016078] [2025-03-16 19:33:38,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:38,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:38,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-16 19:33:38,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-16 19:33:38,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:38,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:39,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:39,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:39,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579016078] [2025-03-16 19:33:39,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579016078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:39,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:39,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-03-16 19:33:39,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550882228] [2025-03-16 19:33:39,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:39,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-16 19:33:39,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:39,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-16 19:33:39,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2025-03-16 19:33:39,331 INFO L87 Difference]: Start difference. First operand 4378 states and 6323 transitions. Second operand has 23 states, 23 states have (on average 3.8260869565217392) internal successors, (88), 22 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:41,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:41,584 INFO L93 Difference]: Finished difference Result 10982 states and 15920 transitions. [2025-03-16 19:33:41,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-16 19:33:41,585 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.8260869565217392) internal successors, (88), 22 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2025-03-16 19:33:41,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:41,594 INFO L225 Difference]: With dead ends: 10982 [2025-03-16 19:33:41,594 INFO L226 Difference]: Without dead ends: 9864 [2025-03-16 19:33:41,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=262, Invalid=1378, Unknown=0, NotChecked=0, Total=1640 [2025-03-16 19:33:41,597 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 1008 mSDsluCounter, 5602 mSDsCounter, 0 mSdLazyCounter, 2623 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1008 SdHoareTripleChecker+Valid, 5972 SdHoareTripleChecker+Invalid, 2623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:41,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1008 Valid, 5972 Invalid, 2623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2623 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 19:33:41,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9864 states. [2025-03-16 19:33:41,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9864 to 4388. [2025-03-16 19:33:41,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4388 states, 4387 states have (on average 1.4442671529519033) internal successors, (6336), 4387 states have internal predecessors, (6336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:41,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4388 states to 4388 states and 6336 transitions. [2025-03-16 19:33:41,656 INFO L78 Accepts]: Start accepts. Automaton has 4388 states and 6336 transitions. Word has length 88 [2025-03-16 19:33:41,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:41,656 INFO L471 AbstractCegarLoop]: Abstraction has 4388 states and 6336 transitions. [2025-03-16 19:33:41,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.8260869565217392) internal successors, (88), 22 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:41,656 INFO L276 IsEmpty]: Start isEmpty. Operand 4388 states and 6336 transitions. [2025-03-16 19:33:41,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-16 19:33:41,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:41,657 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:33:41,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-16 19:33:41,657 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:41,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:41,657 INFO L85 PathProgramCache]: Analyzing trace with hash -65030077, now seen corresponding path program 1 times [2025-03-16 19:33:41,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:41,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635816498] [2025-03-16 19:33:41,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:41,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:41,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-16 19:33:41,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-16 19:33:41,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:41,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:42,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:42,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:42,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635816498] [2025-03-16 19:33:42,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635816498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:42,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:42,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-16 19:33:42,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114596179] [2025-03-16 19:33:42,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:42,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 19:33:42,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:42,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 19:33:42,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-16 19:33:42,027 INFO L87 Difference]: Start difference. First operand 4388 states and 6336 transitions. Second operand has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 13 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:42,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:42,638 INFO L93 Difference]: Finished difference Result 18445 states and 26777 transitions. [2025-03-16 19:33:42,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 19:33:42,638 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 13 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2025-03-16 19:33:42,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:42,656 INFO L225 Difference]: With dead ends: 18445 [2025-03-16 19:33:42,656 INFO L226 Difference]: Without dead ends: 17087 [2025-03-16 19:33:42,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2025-03-16 19:33:42,663 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 816 mSDsluCounter, 3051 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 816 SdHoareTripleChecker+Valid, 3483 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:42,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [816 Valid, 3483 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:33:42,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17087 states. [2025-03-16 19:33:42,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17087 to 4356. [2025-03-16 19:33:42,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4356 states, 4355 states have (on average 1.4445464982778415) internal successors, (6291), 4355 states have internal predecessors, (6291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:42,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4356 states to 4356 states and 6291 transitions. [2025-03-16 19:33:42,756 INFO L78 Accepts]: Start accepts. Automaton has 4356 states and 6291 transitions. Word has length 88 [2025-03-16 19:33:42,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:42,756 INFO L471 AbstractCegarLoop]: Abstraction has 4356 states and 6291 transitions. [2025-03-16 19:33:42,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 13 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:42,756 INFO L276 IsEmpty]: Start isEmpty. Operand 4356 states and 6291 transitions. [2025-03-16 19:33:42,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-16 19:33:42,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:42,757 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:33:42,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-16 19:33:42,757 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:42,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:42,757 INFO L85 PathProgramCache]: Analyzing trace with hash -2064219865, now seen corresponding path program 1 times [2025-03-16 19:33:42,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:42,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928409528] [2025-03-16 19:33:42,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:42,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:42,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-16 19:33:42,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-16 19:33:42,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:42,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:44,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:44,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:44,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928409528] [2025-03-16 19:33:44,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928409528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:44,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:44,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2025-03-16 19:33:44,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163373503] [2025-03-16 19:33:44,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:44,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-16 19:33:44,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:44,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-16 19:33:44,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=634, Unknown=0, NotChecked=0, Total=702 [2025-03-16 19:33:44,493 INFO L87 Difference]: Start difference. First operand 4356 states and 6291 transitions. Second operand has 27 states, 27 states have (on average 3.259259259259259) internal successors, (88), 26 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:48,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:48,721 INFO L93 Difference]: Finished difference Result 13503 states and 19571 transitions. [2025-03-16 19:33:48,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-16 19:33:48,722 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.259259259259259) internal successors, (88), 26 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2025-03-16 19:33:48,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:48,731 INFO L225 Difference]: With dead ends: 13503 [2025-03-16 19:33:48,731 INFO L226 Difference]: Without dead ends: 12380 [2025-03-16 19:33:48,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=574, Invalid=2182, Unknown=0, NotChecked=0, Total=2756 [2025-03-16 19:33:48,734 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 2453 mSDsluCounter, 5761 mSDsCounter, 0 mSdLazyCounter, 3455 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2453 SdHoareTripleChecker+Valid, 6145 SdHoareTripleChecker+Invalid, 3458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 3455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:48,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2453 Valid, 6145 Invalid, 3458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 3455 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 19:33:48,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12380 states. [2025-03-16 19:33:48,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12380 to 4360. [2025-03-16 19:33:48,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4360 states, 4359 states have (on average 1.4441385638908006) internal successors, (6295), 4359 states have internal predecessors, (6295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:48,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4360 states to 4360 states and 6295 transitions. [2025-03-16 19:33:48,794 INFO L78 Accepts]: Start accepts. Automaton has 4360 states and 6295 transitions. Word has length 88 [2025-03-16 19:33:48,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:48,794 INFO L471 AbstractCegarLoop]: Abstraction has 4360 states and 6295 transitions. [2025-03-16 19:33:48,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.259259259259259) internal successors, (88), 26 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:48,795 INFO L276 IsEmpty]: Start isEmpty. Operand 4360 states and 6295 transitions. [2025-03-16 19:33:48,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-16 19:33:48,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:48,795 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:33:48,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-16 19:33:48,795 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:48,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:48,795 INFO L85 PathProgramCache]: Analyzing trace with hash -184701248, now seen corresponding path program 1 times [2025-03-16 19:33:48,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:48,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587201036] [2025-03-16 19:33:48,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:48,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:48,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 19:33:48,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 19:33:48,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:48,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:49,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:49,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:49,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587201036] [2025-03-16 19:33:49,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587201036] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:49,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:49,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-16 19:33:49,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87469763] [2025-03-16 19:33:49,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:49,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-16 19:33:49,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:49,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-16 19:33:49,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:33:49,410 INFO L87 Difference]: Start difference. First operand 4360 states and 6295 transitions. Second operand has 18 states, 18 states have (on average 4.944444444444445) internal successors, (89), 17 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:50,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:50,445 INFO L93 Difference]: Finished difference Result 13925 states and 20211 transitions. [2025-03-16 19:33:50,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-16 19:33:50,446 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.944444444444445) internal successors, (89), 17 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-03-16 19:33:50,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:50,458 INFO L225 Difference]: With dead ends: 13925 [2025-03-16 19:33:50,458 INFO L226 Difference]: Without dead ends: 12807 [2025-03-16 19:33:50,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=261, Invalid=999, Unknown=0, NotChecked=0, Total=1260 [2025-03-16 19:33:50,463 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 965 mSDsluCounter, 3094 mSDsCounter, 0 mSdLazyCounter, 1068 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 965 SdHoareTripleChecker+Valid, 3387 SdHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:50,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [965 Valid, 3387 Invalid, 1069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1068 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:33:50,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12807 states. [2025-03-16 19:33:50,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12807 to 4343. [2025-03-16 19:33:50,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4343 states, 4342 states have (on average 1.444725932749885) internal successors, (6273), 4342 states have internal predecessors, (6273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:50,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4343 states to 4343 states and 6273 transitions. [2025-03-16 19:33:50,546 INFO L78 Accepts]: Start accepts. Automaton has 4343 states and 6273 transitions. Word has length 89 [2025-03-16 19:33:50,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:50,546 INFO L471 AbstractCegarLoop]: Abstraction has 4343 states and 6273 transitions. [2025-03-16 19:33:50,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.944444444444445) internal successors, (89), 17 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:50,546 INFO L276 IsEmpty]: Start isEmpty. Operand 4343 states and 6273 transitions. [2025-03-16 19:33:50,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-16 19:33:50,546 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:50,546 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:33:50,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-16 19:33:50,547 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:50,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:50,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1612563480, now seen corresponding path program 1 times [2025-03-16 19:33:50,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:50,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949001733] [2025-03-16 19:33:50,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:50,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:50,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 19:33:50,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 19:33:50,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:50,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:51,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:51,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:51,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949001733] [2025-03-16 19:33:51,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949001733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:51,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:51,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-16 19:33:51,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246547159] [2025-03-16 19:33:51,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:51,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-16 19:33:51,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:51,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-16 19:33:51,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:33:51,097 INFO L87 Difference]: Start difference. First operand 4343 states and 6273 transitions. Second operand has 17 states, 17 states have (on average 5.235294117647059) internal successors, (89), 16 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:52,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:52,079 INFO L93 Difference]: Finished difference Result 13902 states and 20184 transitions. [2025-03-16 19:33:52,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-16 19:33:52,082 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.235294117647059) internal successors, (89), 16 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-03-16 19:33:52,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:52,095 INFO L225 Difference]: With dead ends: 13902 [2025-03-16 19:33:52,095 INFO L226 Difference]: Without dead ends: 12785 [2025-03-16 19:33:52,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2025-03-16 19:33:52,100 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 939 mSDsluCounter, 2731 mSDsCounter, 0 mSdLazyCounter, 1010 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 939 SdHoareTripleChecker+Valid, 3042 SdHoareTripleChecker+Invalid, 1010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:52,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [939 Valid, 3042 Invalid, 1010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1010 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:33:52,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12785 states. [2025-03-16 19:33:52,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12785 to 4342. [2025-03-16 19:33:52,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4342 states, 4341 states have (on average 1.4445980188896568) internal successors, (6271), 4341 states have internal predecessors, (6271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:52,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4342 states to 4342 states and 6271 transitions. [2025-03-16 19:33:52,175 INFO L78 Accepts]: Start accepts. Automaton has 4342 states and 6271 transitions. Word has length 89 [2025-03-16 19:33:52,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:52,175 INFO L471 AbstractCegarLoop]: Abstraction has 4342 states and 6271 transitions. [2025-03-16 19:33:52,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.235294117647059) internal successors, (89), 16 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:52,176 INFO L276 IsEmpty]: Start isEmpty. Operand 4342 states and 6271 transitions. [2025-03-16 19:33:52,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-16 19:33:52,176 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:52,176 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:33:52,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-16 19:33:52,176 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:52,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:52,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1044239907, now seen corresponding path program 1 times [2025-03-16 19:33:52,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:52,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790326820] [2025-03-16 19:33:52,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:52,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:52,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-16 19:33:52,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-16 19:33:52,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:52,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:52,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:52,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:52,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790326820] [2025-03-16 19:33:52,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790326820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:52,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:52,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 19:33:52,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978752397] [2025-03-16 19:33:52,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:52,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 19:33:52,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:52,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 19:33:52,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:33:52,436 INFO L87 Difference]: Start difference. First operand 4342 states and 6271 transitions. Second operand has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:52,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:52,668 INFO L93 Difference]: Finished difference Result 9457 states and 13722 transitions. [2025-03-16 19:33:52,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:33:52,669 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-03-16 19:33:52,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:52,674 INFO L225 Difference]: With dead ends: 9457 [2025-03-16 19:33:52,674 INFO L226 Difference]: Without dead ends: 8316 [2025-03-16 19:33:52,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:33:52,677 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 580 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 1275 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:52,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 1275 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:33:52,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8316 states. [2025-03-16 19:33:52,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8316 to 4210. [2025-03-16 19:33:52,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4210 states, 4209 states have (on average 1.4466619149441673) internal successors, (6089), 4209 states have internal predecessors, (6089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:52,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4210 states to 4210 states and 6089 transitions. [2025-03-16 19:33:52,721 INFO L78 Accepts]: Start accepts. Automaton has 4210 states and 6089 transitions. Word has length 90 [2025-03-16 19:33:52,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:52,721 INFO L471 AbstractCegarLoop]: Abstraction has 4210 states and 6089 transitions. [2025-03-16 19:33:52,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:52,721 INFO L276 IsEmpty]: Start isEmpty. Operand 4210 states and 6089 transitions. [2025-03-16 19:33:52,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-16 19:33:52,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:52,722 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:33:52,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-16 19:33:52,722 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:52,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:52,723 INFO L85 PathProgramCache]: Analyzing trace with hash -105868381, now seen corresponding path program 1 times [2025-03-16 19:33:52,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:52,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140424940] [2025-03-16 19:33:52,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:52,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:52,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-16 19:33:52,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-16 19:33:52,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:52,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:52,797 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:52,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:52,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140424940] [2025-03-16 19:33:52,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140424940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:52,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:52,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:33:52,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482108197] [2025-03-16 19:33:52,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:52,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:33:52,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:52,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:33:52,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:33:52,799 INFO L87 Difference]: Start difference. First operand 4210 states and 6089 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:52,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:52,821 INFO L93 Difference]: Finished difference Result 8840 states and 12830 transitions. [2025-03-16 19:33:52,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:33:52,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2025-03-16 19:33:52,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:52,826 INFO L225 Difference]: With dead ends: 8840 [2025-03-16 19:33:52,826 INFO L226 Difference]: Without dead ends: 5914 [2025-03-16 19:33:52,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:33:52,829 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 83 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:52,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 394 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:33:52,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5914 states. [2025-03-16 19:33:52,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5914 to 5696. [2025-03-16 19:33:52,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5696 states, 5695 states have (on average 1.4396839332748024) internal successors, (8199), 5695 states have internal predecessors, (8199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:52,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5696 states to 5696 states and 8199 transitions. [2025-03-16 19:33:52,872 INFO L78 Accepts]: Start accepts. Automaton has 5696 states and 8199 transitions. Word has length 116 [2025-03-16 19:33:52,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:52,872 INFO L471 AbstractCegarLoop]: Abstraction has 5696 states and 8199 transitions. [2025-03-16 19:33:52,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:52,872 INFO L276 IsEmpty]: Start isEmpty. Operand 5696 states and 8199 transitions. [2025-03-16 19:33:52,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-16 19:33:52,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:52,873 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:33:52,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-16 19:33:52,873 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:52,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:52,873 INFO L85 PathProgramCache]: Analyzing trace with hash 385311399, now seen corresponding path program 1 times [2025-03-16 19:33:52,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:52,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674656319] [2025-03-16 19:33:52,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:52,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:52,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-16 19:33:52,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-16 19:33:52,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:52,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:52,951 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:52,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:52,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674656319] [2025-03-16 19:33:52,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674656319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:52,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:52,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:33:52,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334082796] [2025-03-16 19:33:52,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:52,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:33:52,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:52,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:33:52,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:33:52,953 INFO L87 Difference]: Start difference. First operand 5696 states and 8199 transitions. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:53,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:53,167 INFO L93 Difference]: Finished difference Result 15172 states and 22019 transitions. [2025-03-16 19:33:53,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:33:53,168 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2025-03-16 19:33:53,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:53,176 INFO L225 Difference]: With dead ends: 15172 [2025-03-16 19:33:53,176 INFO L226 Difference]: Without dead ends: 9600 [2025-03-16 19:33:53,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:33:53,181 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 873 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 873 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:53,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [873 Valid, 409 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:33:53,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9600 states. [2025-03-16 19:33:53,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9600 to 6182. [2025-03-16 19:33:53,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6182 states, 6181 states have (on average 1.435690017796473) internal successors, (8874), 6181 states have internal predecessors, (8874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:53,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6182 states to 6182 states and 8874 transitions. [2025-03-16 19:33:53,237 INFO L78 Accepts]: Start accepts. Automaton has 6182 states and 8874 transitions. Word has length 118 [2025-03-16 19:33:53,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:53,237 INFO L471 AbstractCegarLoop]: Abstraction has 6182 states and 8874 transitions. [2025-03-16 19:33:53,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:53,237 INFO L276 IsEmpty]: Start isEmpty. Operand 6182 states and 8874 transitions. [2025-03-16 19:33:53,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-16 19:33:53,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:53,238 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:33:53,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-16 19:33:53,238 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:53,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:53,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1716119577, now seen corresponding path program 1 times [2025-03-16 19:33:53,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:53,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932191661] [2025-03-16 19:33:53,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:53,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:53,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-16 19:33:53,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-16 19:33:53,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:53,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:53,310 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:53,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:53,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932191661] [2025-03-16 19:33:53,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932191661] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:53,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:53,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:33:53,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45352506] [2025-03-16 19:33:53,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:53,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:33:53,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:53,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:33:53,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:33:53,312 INFO L87 Difference]: Start difference. First operand 6182 states and 8874 transitions. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:53,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:53,493 INFO L93 Difference]: Finished difference Result 24462 states and 35506 transitions. [2025-03-16 19:33:53,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:33:53,493 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2025-03-16 19:33:53,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:53,510 INFO L225 Difference]: With dead ends: 24462 [2025-03-16 19:33:53,510 INFO L226 Difference]: Without dead ends: 18422 [2025-03-16 19:33:53,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:33:53,518 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 1019 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1019 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:53,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1019 Valid, 341 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:33:53,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18422 states. [2025-03-16 19:33:53,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18422 to 13220. [2025-03-16 19:33:53,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13220 states, 13219 states have (on average 1.4364929268477191) internal successors, (18989), 13219 states have internal predecessors, (18989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:53,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13220 states to 13220 states and 18989 transitions. [2025-03-16 19:33:53,684 INFO L78 Accepts]: Start accepts. Automaton has 13220 states and 18989 transitions. Word has length 118 [2025-03-16 19:33:53,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:53,684 INFO L471 AbstractCegarLoop]: Abstraction has 13220 states and 18989 transitions. [2025-03-16 19:33:53,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:53,684 INFO L276 IsEmpty]: Start isEmpty. Operand 13220 states and 18989 transitions. [2025-03-16 19:33:53,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-16 19:33:53,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:53,685 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:33:53,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-16 19:33:53,685 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:53,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:53,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1370527995, now seen corresponding path program 1 times [2025-03-16 19:33:53,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:53,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971299380] [2025-03-16 19:33:53,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:53,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:53,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-16 19:33:53,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-16 19:33:53,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:53,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:53,797 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:53,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:53,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971299380] [2025-03-16 19:33:53,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971299380] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:53,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:53,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:33:53,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483308304] [2025-03-16 19:33:53,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:53,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:33:53,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:53,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:33:53,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:33:53,799 INFO L87 Difference]: Start difference. First operand 13220 states and 18989 transitions. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:54,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:54,065 INFO L93 Difference]: Finished difference Result 43776 states and 63051 transitions. [2025-03-16 19:33:54,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:33:54,066 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2025-03-16 19:33:54,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:54,102 INFO L225 Difference]: With dead ends: 43776 [2025-03-16 19:33:54,103 INFO L226 Difference]: Without dead ends: 30698 [2025-03-16 19:33:54,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:33:54,119 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 849 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:54,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [849 Valid, 337 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:33:54,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30698 states. [2025-03-16 19:33:54,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30698 to 28296. [2025-03-16 19:33:54,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28296 states, 28295 states have (on average 1.4355539848029688) internal successors, (40619), 28295 states have internal predecessors, (40619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:54,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28296 states to 28296 states and 40619 transitions. [2025-03-16 19:33:54,383 INFO L78 Accepts]: Start accepts. Automaton has 28296 states and 40619 transitions. Word has length 118 [2025-03-16 19:33:54,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:54,383 INFO L471 AbstractCegarLoop]: Abstraction has 28296 states and 40619 transitions. [2025-03-16 19:33:54,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:54,383 INFO L276 IsEmpty]: Start isEmpty. Operand 28296 states and 40619 transitions. [2025-03-16 19:33:54,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-16 19:33:54,384 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:54,384 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:33:54,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-16 19:33:54,384 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:54,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:54,384 INFO L85 PathProgramCache]: Analyzing trace with hash -80237947, now seen corresponding path program 1 times [2025-03-16 19:33:54,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:54,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092103934] [2025-03-16 19:33:54,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:54,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:54,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-16 19:33:54,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-16 19:33:54,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:54,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:54,456 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:54,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:54,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092103934] [2025-03-16 19:33:54,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092103934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:54,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:54,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:33:54,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44506969] [2025-03-16 19:33:54,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:54,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:33:54,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:54,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:33:54,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:33:54,457 INFO L87 Difference]: Start difference. First operand 28296 states and 40619 transitions. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:54,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:54,823 INFO L93 Difference]: Finished difference Result 98604 states and 142341 transitions. [2025-03-16 19:33:54,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:33:54,823 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2025-03-16 19:33:54,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:54,889 INFO L225 Difference]: With dead ends: 98604 [2025-03-16 19:33:54,889 INFO L226 Difference]: Without dead ends: 70450 [2025-03-16 19:33:54,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:33:54,911 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 934 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 934 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:54,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [934 Valid, 339 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:33:54,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70450 states. [2025-03-16 19:33:55,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70450 to 60448. [2025-03-16 19:33:55,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60448 states, 60447 states have (on average 1.4339669462504343) internal successors, (86679), 60447 states have internal predecessors, (86679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:55,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60448 states to 60448 states and 86679 transitions. [2025-03-16 19:33:55,471 INFO L78 Accepts]: Start accepts. Automaton has 60448 states and 86679 transitions. Word has length 118 [2025-03-16 19:33:55,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:55,472 INFO L471 AbstractCegarLoop]: Abstraction has 60448 states and 86679 transitions. [2025-03-16 19:33:55,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:55,472 INFO L276 IsEmpty]: Start isEmpty. Operand 60448 states and 86679 transitions. [2025-03-16 19:33:55,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-16 19:33:55,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:55,479 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 19:33:55,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-16 19:33:55,479 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:55,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:55,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1144014900, now seen corresponding path program 1 times [2025-03-16 19:33:55,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:55,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195754804] [2025-03-16 19:33:55,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:55,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:55,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-16 19:33:55,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-16 19:33:55,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:55,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:55,674 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-16 19:33:55,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:55,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195754804] [2025-03-16 19:33:55,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195754804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:55,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:55,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:33:55,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933711105] [2025-03-16 19:33:55,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:55,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:33:55,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:55,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:33:55,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:33:55,675 INFO L87 Difference]: Start difference. First operand 60448 states and 86679 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:55,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:55,886 INFO L93 Difference]: Finished difference Result 116532 states and 166769 transitions. [2025-03-16 19:33:55,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:33:55,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 145 [2025-03-16 19:33:55,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:55,948 INFO L225 Difference]: With dead ends: 116532 [2025-03-16 19:33:55,948 INFO L226 Difference]: Without dead ends: 56220 [2025-03-16 19:33:55,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:33:55,986 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 76 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:55,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 383 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:33:56,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56220 states. [2025-03-16 19:33:56,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56220 to 54958. [2025-03-16 19:33:56,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54958 states, 54957 states have (on average 1.4202740324253507) internal successors, (78054), 54957 states have internal predecessors, (78054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:56,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54958 states to 54958 states and 78054 transitions. [2025-03-16 19:33:56,608 INFO L78 Accepts]: Start accepts. Automaton has 54958 states and 78054 transitions. Word has length 145 [2025-03-16 19:33:56,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:56,608 INFO L471 AbstractCegarLoop]: Abstraction has 54958 states and 78054 transitions. [2025-03-16 19:33:56,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:56,608 INFO L276 IsEmpty]: Start isEmpty. Operand 54958 states and 78054 transitions. [2025-03-16 19:33:56,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-16 19:33:56,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:56,614 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2025-03-16 19:33:56,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-16 19:33:56,614 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:56,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:56,615 INFO L85 PathProgramCache]: Analyzing trace with hash -84526051, now seen corresponding path program 1 times [2025-03-16 19:33:56,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:56,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182304901] [2025-03-16 19:33:56,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:56,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:56,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-16 19:33:56,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-16 19:33:56,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:56,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:56,684 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-16 19:33:56,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:56,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182304901] [2025-03-16 19:33:56,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182304901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:56,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:56,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:33:56,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82601965] [2025-03-16 19:33:56,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:56,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:33:56,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:56,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:33:56,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:33:56,686 INFO L87 Difference]: Start difference. First operand 54958 states and 78054 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:56,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:56,875 INFO L93 Difference]: Finished difference Result 105594 states and 149576 transitions. [2025-03-16 19:33:56,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:33:56,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 146 [2025-03-16 19:33:56,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:56,929 INFO L225 Difference]: With dead ends: 105594 [2025-03-16 19:33:56,929 INFO L226 Difference]: Without dead ends: 50760 [2025-03-16 19:33:56,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:33:56,963 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 69 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:56,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 384 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:33:56,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50760 states. [2025-03-16 19:33:57,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50760 to 49558. [2025-03-16 19:33:57,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49558 states, 49557 states have (on average 1.4055330225800593) internal successors, (69654), 49557 states have internal predecessors, (69654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:57,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49558 states to 49558 states and 69654 transitions. [2025-03-16 19:33:57,689 INFO L78 Accepts]: Start accepts. Automaton has 49558 states and 69654 transitions. Word has length 146 [2025-03-16 19:33:57,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:57,689 INFO L471 AbstractCegarLoop]: Abstraction has 49558 states and 69654 transitions. [2025-03-16 19:33:57,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:57,689 INFO L276 IsEmpty]: Start isEmpty. Operand 49558 states and 69654 transitions. [2025-03-16 19:33:57,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-16 19:33:57,696 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:57,696 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:33:57,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-16 19:33:57,696 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:57,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:57,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1697846631, now seen corresponding path program 1 times [2025-03-16 19:33:57,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:57,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235481639] [2025-03-16 19:33:57,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:57,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:57,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-16 19:33:57,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-16 19:33:57,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:57,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:57,804 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-16 19:33:57,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:57,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235481639] [2025-03-16 19:33:57,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235481639] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:57,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:57,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:33:57,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784426400] [2025-03-16 19:33:57,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:57,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:33:57,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:57,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:33:57,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:33:57,805 INFO L87 Difference]: Start difference. First operand 49558 states and 69654 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:58,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:58,169 INFO L93 Difference]: Finished difference Result 94794 states and 132776 transitions. [2025-03-16 19:33:58,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:33:58,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 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 147 [2025-03-16 19:33:58,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:58,207 INFO L225 Difference]: With dead ends: 94794 [2025-03-16 19:33:58,207 INFO L226 Difference]: Without dead ends: 45360 [2025-03-16 19:33:58,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:33:58,228 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 62 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:58,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 385 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:33:58,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45360 states. [2025-03-16 19:33:58,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45360 to 44158. [2025-03-16 19:33:58,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44158 states, 44157 states have (on average 1.3871866295264623) internal successors, (61254), 44157 states have internal predecessors, (61254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:58,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44158 states to 44158 states and 61254 transitions. [2025-03-16 19:33:58,585 INFO L78 Accepts]: Start accepts. Automaton has 44158 states and 61254 transitions. Word has length 147 [2025-03-16 19:33:58,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:58,585 INFO L471 AbstractCegarLoop]: Abstraction has 44158 states and 61254 transitions. [2025-03-16 19:33:58,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:58,585 INFO L276 IsEmpty]: Start isEmpty. Operand 44158 states and 61254 transitions. [2025-03-16 19:33:58,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-16 19:33:58,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:58,589 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:33:58,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-16 19:33:58,589 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:58,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:58,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1104810698, now seen corresponding path program 1 times [2025-03-16 19:33:58,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:58,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371560513] [2025-03-16 19:33:58,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:58,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:58,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-16 19:33:58,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-16 19:33:58,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:58,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:58,750 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 19:33:58,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:58,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371560513] [2025-03-16 19:33:58,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371560513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:58,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:58,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:33:58,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666131811] [2025-03-16 19:33:58,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:58,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:33:58,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:58,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:33:58,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:33:58,754 INFO L87 Difference]: Start difference. First operand 44158 states and 61254 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:33:58,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:58,956 INFO L93 Difference]: Finished difference Result 127826 states and 176296 transitions. [2025-03-16 19:33:58,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:33:58,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2025-03-16 19:33:58,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:59,047 INFO L225 Difference]: With dead ends: 127826 [2025-03-16 19:33:59,047 INFO L226 Difference]: Without dead ends: 83792 [2025-03-16 19:33:59,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:33:59,091 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 55 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:59,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 386 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:33:59,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83792 states. [2025-03-16 19:33:59,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83792 to 78190. [2025-03-16 19:33:59,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78190 states, 78189 states have (on average 1.3707043190218573) internal successors, (107174), 78189 states have internal predecessors, (107174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:00,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78190 states to 78190 states and 107174 transitions. [2025-03-16 19:34:00,046 INFO L78 Accepts]: Start accepts. Automaton has 78190 states and 107174 transitions. Word has length 148 [2025-03-16 19:34:00,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:00,046 INFO L471 AbstractCegarLoop]: Abstraction has 78190 states and 107174 transitions. [2025-03-16 19:34:00,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:00,046 INFO L276 IsEmpty]: Start isEmpty. Operand 78190 states and 107174 transitions. [2025-03-16 19:34:00,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-16 19:34:00,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:00,051 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:34:00,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-16 19:34:00,051 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:34:00,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:00,052 INFO L85 PathProgramCache]: Analyzing trace with hash 506751845, now seen corresponding path program 1 times [2025-03-16 19:34:00,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:00,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837291605] [2025-03-16 19:34:00,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:00,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:00,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-16 19:34:00,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-16 19:34:00,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:00,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:00,449 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:00,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:00,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837291605] [2025-03-16 19:34:00,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837291605] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:34:00,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388475522] [2025-03-16 19:34:00,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:00,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:34:00,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:34:00,452 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-16 19:34:00,453 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-16 19:34:00,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-16 19:34:00,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-16 19:34:00,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:00,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:00,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-16 19:34:00,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:34:01,678 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:01,678 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:34:03,009 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:03,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388475522] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:34:03,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:34:03,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2025-03-16 19:34:03,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660184476] [2025-03-16 19:34:03,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:34:03,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-16 19:34:03,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:03,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-16 19:34:03,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=876, Unknown=0, NotChecked=0, Total=992 [2025-03-16 19:34:03,011 INFO L87 Difference]: Start difference. First operand 78190 states and 107174 transitions. Second operand has 32 states, 32 states have (on average 12.96875) internal successors, (415), 31 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:10,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:10,200 INFO L93 Difference]: Finished difference Result 885718 states and 1207427 transitions. [2025-03-16 19:34:10,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2025-03-16 19:34:10,201 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 12.96875) internal successors, (415), 31 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 149 [2025-03-16 19:34:10,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:12,354 INFO L225 Difference]: With dead ends: 885718 [2025-03-16 19:34:12,355 INFO L226 Difference]: Without dead ends: 807652 [2025-03-16 19:34:12,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5691 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=3238, Invalid=16222, Unknown=0, NotChecked=0, Total=19460 [2025-03-16 19:34:12,737 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 7402 mSDsluCounter, 2067 mSDsCounter, 0 mSdLazyCounter, 2694 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7402 SdHoareTripleChecker+Valid, 2216 SdHoareTripleChecker+Invalid, 2799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 2694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:12,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7402 Valid, 2216 Invalid, 2799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 2694 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 19:34:13,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807652 states. [2025-03-16 19:34:19,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807652 to 452224. [2025-03-16 19:34:19,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452224 states, 452223 states have (on average 1.3670423662662006) internal successors, (618208), 452223 states have internal predecessors, (618208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:20,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452224 states to 452224 states and 618208 transitions. [2025-03-16 19:34:20,841 INFO L78 Accepts]: Start accepts. Automaton has 452224 states and 618208 transitions. Word has length 149 [2025-03-16 19:34:20,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:20,841 INFO L471 AbstractCegarLoop]: Abstraction has 452224 states and 618208 transitions. [2025-03-16 19:34:20,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 12.96875) internal successors, (415), 31 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:20,842 INFO L276 IsEmpty]: Start isEmpty. Operand 452224 states and 618208 transitions. [2025-03-16 19:34:20,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-16 19:34:20,863 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:20,863 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:34:20,870 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-16 19:34:21,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:34:21,064 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:34:21,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:21,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1336900671, now seen corresponding path program 1 times [2025-03-16 19:34:21,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:21,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267005821] [2025-03-16 19:34:21,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:21,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:21,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-16 19:34:21,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-16 19:34:21,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:21,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:21,582 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:21,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:21,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267005821] [2025-03-16 19:34:21,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267005821] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:34:21,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620359455] [2025-03-16 19:34:21,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:21,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:34:21,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:34:21,584 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-16 19:34:21,585 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-16 19:34:21,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-16 19:34:21,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-16 19:34:21,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:21,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:21,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-16 19:34:21,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:34:22,558 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:22,559 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:34:23,779 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:23,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620359455] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:34:23,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:34:23,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 33 [2025-03-16 19:34:23,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038674466] [2025-03-16 19:34:23,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:34:23,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-16 19:34:23,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:23,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-16 19:34:23,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1002, Unknown=0, NotChecked=0, Total=1122 [2025-03-16 19:34:23,782 INFO L87 Difference]: Start difference. First operand 452224 states and 618208 transitions. Second operand has 34 states, 34 states have (on average 12.823529411764707) internal successors, (436), 33 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)