./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 e2fb8bed 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-?-e2fb8be-m [2025-03-08 06:25:22,883 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:25:22,940 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:25:22,943 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:25:22,944 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:25:22,964 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:25:22,965 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:25:22,965 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:25:22,966 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:25:22,966 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:25:22,966 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:25:22,966 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:25:22,966 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:25:22,966 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:25:22,967 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:25:22,967 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:25:22,967 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:25:22,967 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:25:22,967 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:25:22,967 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:25:22,967 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:25:22,967 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:25:22,967 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:25:22,967 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:25:22,967 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:25:22,968 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:25:22,968 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:25:22,968 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:25:22,968 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:25:22,968 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:25:22,968 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:25:22,968 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:25:22,968 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:25:22,968 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:25:22,968 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:25:22,968 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:25:22,968 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:25:22,969 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:25:22,969 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:25:22,969 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:25:22,969 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:25:22,969 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:25:22,969 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:25:22,969 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-08 06:25:23,197 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:25:23,204 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:25:23,207 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:25:23,208 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:25:23,208 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:25:23,209 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-08 06:25:24,314 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1242ef79e/e3bf8d7dea224d668545304d7f4c3408/FLAG1969977c6 [2025-03-08 06:25:24,614 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:25:24,615 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-08 06:25:24,629 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1242ef79e/e3bf8d7dea224d668545304d7f4c3408/FLAG1969977c6 [2025-03-08 06:25:24,894 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1242ef79e/e3bf8d7dea224d668545304d7f4c3408 [2025-03-08 06:25:24,896 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:25:24,897 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:25:24,897 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:25:24,898 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:25:24,900 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:25:24,901 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:25:24" (1/1) ... [2025-03-08 06:25:24,902 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55bee783 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:25:24, skipping insertion in model container [2025-03-08 06:25:24,902 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:25:24" (1/1) ... [2025-03-08 06:25:24,927 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:25:25,090 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-08 06:25:25,124 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:25:25,135 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:25:25,170 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-08 06:25:25,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:25:25,197 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:25:25,197 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:25:25 WrapperNode [2025-03-08 06:25:25,197 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:25:25,199 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:25:25,199 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:25:25,199 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:25:25,204 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:25:25" (1/1) ... [2025-03-08 06:25:25,212 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:25:25" (1/1) ... [2025-03-08 06:25:25,233 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 688 [2025-03-08 06:25:25,233 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:25:25,234 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:25:25,234 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:25:25,234 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:25:25,240 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:25:25" (1/1) ... [2025-03-08 06:25:25,240 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:25:25" (1/1) ... [2025-03-08 06:25:25,243 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:25:25" (1/1) ... [2025-03-08 06:25:25,258 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-08 06:25:25,258 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:25:25" (1/1) ... [2025-03-08 06:25:25,258 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:25:25" (1/1) ... [2025-03-08 06:25:25,265 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:25:25" (1/1) ... [2025-03-08 06:25:25,267 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:25:25" (1/1) ... [2025-03-08 06:25:25,269 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:25:25" (1/1) ... [2025-03-08 06:25:25,270 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:25:25" (1/1) ... [2025-03-08 06:25:25,274 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:25:25,274 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:25:25,274 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:25:25,274 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:25:25,275 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:25:25" (1/1) ... [2025-03-08 06:25:25,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:25:25,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:25:25,305 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-08 06:25:25,309 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-08 06:25:25,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:25:25,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:25:25,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:25:25,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:25:25,424 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:25:25,426 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:25:25,968 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L664: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-08 06:25:25,969 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L619: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-08 06:25:25,969 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L574: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-03-08 06:25:25,969 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L477: havoc main_~node4__m4~2#1; [2025-03-08 06:25:25,969 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L462: havoc main_~node3__m3~2#1; [2025-03-08 06:25:25,969 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L710: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-08 06:25:25,969 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L529: havoc main_~node5____CPAchecker_TMP_0~1#1;havoc main_~node5__m5~2#1; [2025-03-08 06:25:25,969 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L447: havoc main_~node2__m2~2#1; [2025-03-08 06:25:25,969 INFO L1307 $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-08 06:25:26,010 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2025-03-08 06:25:26,010 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:25:26,018 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:25:26,018 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:25:26,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:25:26 BoogieIcfgContainer [2025-03-08 06:25:26,019 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:25:26,020 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:25:26,020 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:25:26,023 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:25:26,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:25:24" (1/3) ... [2025-03-08 06:25:26,024 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66101d41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:25:26, skipping insertion in model container [2025-03-08 06:25:26,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:25:25" (2/3) ... [2025-03-08 06:25:26,024 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66101d41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:25:26, skipping insertion in model container [2025-03-08 06:25:26,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:25:26" (3/3) ... [2025-03-08 06:25:26,025 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2025-03-08 06:25:26,035 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:25:26,036 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, 150 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-08 06:25:26,079 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:25:26,090 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;@75279cd0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:25:26,090 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 06:25:26,095 INFO L276 IsEmpty]: Start isEmpty. Operand has 150 states, 148 states have (on average 1.7567567567567568) internal successors, (260), 149 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:26,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 06:25:26,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:26,101 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] [2025-03-08 06:25:26,101 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:25:26,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:26,105 INFO L85 PathProgramCache]: Analyzing trace with hash 2097982300, now seen corresponding path program 1 times [2025-03-08 06:25:26,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:26,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672091734] [2025-03-08 06:25:26,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:26,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:26,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 06:25:26,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 06:25:26,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:26,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:26,715 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-08 06:25:26,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:26,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672091734] [2025-03-08 06:25:26,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672091734] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:26,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:26,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 06:25:26,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951361835] [2025-03-08 06:25:26,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:26,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:25:26,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:26,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:25:26,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:25:26,739 INFO L87 Difference]: Start difference. First operand has 150 states, 148 states have (on average 1.7567567567567568) internal successors, (260), 149 states have internal predecessors, (260), 0 states have call successors, (0), 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.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:27,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:27,073 INFO L93 Difference]: Finished difference Result 845 states and 1355 transitions. [2025-03-08 06:25:27,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 06:25:27,075 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2025-03-08 06:25:27,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:27,083 INFO L225 Difference]: With dead ends: 845 [2025-03-08 06:25:27,084 INFO L226 Difference]: Without dead ends: 751 [2025-03-08 06:25:27,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-03-08 06:25:27,088 INFO L435 NwaCegarLoop]: 605 mSDtfsCounter, 1364 mSDsluCounter, 2394 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1364 SdHoareTripleChecker+Valid, 2999 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:27,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1364 Valid, 2999 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:25:27,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2025-03-08 06:25:27,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 227. [2025-03-08 06:25:27,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 226 states have (on average 1.4513274336283186) internal successors, (328), 226 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:27,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 328 transitions. [2025-03-08 06:25:27,138 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 328 transitions. Word has length 76 [2025-03-08 06:25:27,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:27,138 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 328 transitions. [2025-03-08 06:25:27,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:27,139 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 328 transitions. [2025-03-08 06:25:27,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 06:25:27,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:27,140 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-08 06:25:27,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:25:27,141 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:25:27,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:27,141 INFO L85 PathProgramCache]: Analyzing trace with hash -67695176, now seen corresponding path program 1 times [2025-03-08 06:25:27,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:27,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162852570] [2025-03-08 06:25:27,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:27,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:27,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 06:25:27,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 06:25:27,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:27,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:27,432 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-08 06:25:27,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:27,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162852570] [2025-03-08 06:25:27,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162852570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:27,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:27,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 06:25:27,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302611104] [2025-03-08 06:25:27,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:27,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:25:27,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:27,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:25:27,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:25:27,434 INFO L87 Difference]: Start difference. First operand 227 states and 328 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:27,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:27,624 INFO L93 Difference]: Finished difference Result 922 states and 1419 transitions. [2025-03-08 06:25:27,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 06:25:27,625 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-08 06:25:27,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:27,628 INFO L225 Difference]: With dead ends: 922 [2025-03-08 06:25:27,628 INFO L226 Difference]: Without dead ends: 802 [2025-03-08 06:25:27,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 06:25:27,629 INFO L435 NwaCegarLoop]: 573 mSDtfsCounter, 943 mSDsluCounter, 1299 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 943 SdHoareTripleChecker+Valid, 1872 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:27,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [943 Valid, 1872 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:25:27,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2025-03-08 06:25:27,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 361. [2025-03-08 06:25:27,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 360 states have (on average 1.5) internal successors, (540), 360 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:27,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 540 transitions. [2025-03-08 06:25:27,651 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 540 transitions. Word has length 78 [2025-03-08 06:25:27,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:27,651 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 540 transitions. [2025-03-08 06:25:27,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:27,651 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 540 transitions. [2025-03-08 06:25:27,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 06:25:27,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:27,656 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-08 06:25:27,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:25:27,656 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:25:27,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:27,658 INFO L85 PathProgramCache]: Analyzing trace with hash -744597312, now seen corresponding path program 1 times [2025-03-08 06:25:27,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:27,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615724958] [2025-03-08 06:25:27,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:27,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:27,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 06:25:27,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 06:25:27,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:27,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:27,840 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-08 06:25:27,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:27,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615724958] [2025-03-08 06:25:27,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615724958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:27,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:27,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 06:25:27,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78084974] [2025-03-08 06:25:27,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:27,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:25:27,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:27,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:25:27,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:25:27,842 INFO L87 Difference]: Start difference. First operand 361 states and 540 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:27,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:27,997 INFO L93 Difference]: Finished difference Result 1056 states and 1631 transitions. [2025-03-08 06:25:27,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 06:25:27,998 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-08 06:25:27,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:28,001 INFO L225 Difference]: With dead ends: 1056 [2025-03-08 06:25:28,001 INFO L226 Difference]: Without dead ends: 936 [2025-03-08 06:25:28,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 06:25:28,002 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 936 mSDsluCounter, 1001 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 1481 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:28,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [936 Valid, 1481 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:25:28,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2025-03-08 06:25:28,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 554. [2025-03-08 06:25:28,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 553 states have (on average 1.5280289330922243) internal successors, (845), 553 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:28,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 845 transitions. [2025-03-08 06:25:28,015 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 845 transitions. Word has length 78 [2025-03-08 06:25:28,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:28,016 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 845 transitions. [2025-03-08 06:25:28,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:28,016 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 845 transitions. [2025-03-08 06:25:28,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 06:25:28,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:28,017 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-08 06:25:28,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:25:28,017 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:25:28,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:28,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1658299456, now seen corresponding path program 1 times [2025-03-08 06:25:28,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:28,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377142935] [2025-03-08 06:25:28,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:28,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:28,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 06:25:28,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 06:25:28,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:28,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:28,197 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-08 06:25:28,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:28,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377142935] [2025-03-08 06:25:28,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377142935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:28,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:28,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 06:25:28,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912051372] [2025-03-08 06:25:28,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:28,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:25:28,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:28,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:25:28,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:25:28,199 INFO L87 Difference]: Start difference. First operand 554 states and 845 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:28,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:28,345 INFO L93 Difference]: Finished difference Result 1185 states and 1835 transitions. [2025-03-08 06:25:28,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 06:25:28,345 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-08 06:25:28,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:28,350 INFO L225 Difference]: With dead ends: 1185 [2025-03-08 06:25:28,350 INFO L226 Difference]: Without dead ends: 1065 [2025-03-08 06:25:28,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 06:25:28,351 INFO L435 NwaCegarLoop]: 379 mSDtfsCounter, 1106 mSDsluCounter, 976 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1106 SdHoareTripleChecker+Valid, 1355 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:28,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1106 Valid, 1355 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:25:28,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2025-03-08 06:25:28,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 678. [2025-03-08 06:25:28,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 677 states have (on average 1.5376661742983753) internal successors, (1041), 677 states have internal predecessors, (1041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:28,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 1041 transitions. [2025-03-08 06:25:28,370 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 1041 transitions. Word has length 78 [2025-03-08 06:25:28,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:28,371 INFO L471 AbstractCegarLoop]: Abstraction has 678 states and 1041 transitions. [2025-03-08 06:25:28,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:28,372 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 1041 transitions. [2025-03-08 06:25:28,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 06:25:28,373 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:28,373 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-08 06:25:28,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:25:28,373 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:25:28,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:28,373 INFO L85 PathProgramCache]: Analyzing trace with hash 586614712, now seen corresponding path program 1 times [2025-03-08 06:25:28,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:28,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611645510] [2025-03-08 06:25:28,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:28,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:28,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 06:25:28,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 06:25:28,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:28,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:28,526 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-08 06:25:28,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:28,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611645510] [2025-03-08 06:25:28,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611645510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:28,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:28,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 06:25:28,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316268363] [2025-03-08 06:25:28,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:28,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:25:28,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:28,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:25:28,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:25:28,528 INFO L87 Difference]: Start difference. First operand 678 states and 1041 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:28,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:28,652 INFO L93 Difference]: Finished difference Result 1304 states and 2023 transitions. [2025-03-08 06:25:28,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 06:25:28,652 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-08 06:25:28,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:28,656 INFO L225 Difference]: With dead ends: 1304 [2025-03-08 06:25:28,656 INFO L226 Difference]: Without dead ends: 1184 [2025-03-08 06:25:28,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 06:25:28,659 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 1199 mSDsluCounter, 962 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1199 SdHoareTripleChecker+Valid, 1248 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:28,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1199 Valid, 1248 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:25:28,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2025-03-08 06:25:28,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 797. [2025-03-08 06:25:28,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 796 states have (on average 1.5439698492462313) internal successors, (1229), 796 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:28,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1229 transitions. [2025-03-08 06:25:28,684 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1229 transitions. Word has length 78 [2025-03-08 06:25:28,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:28,685 INFO L471 AbstractCegarLoop]: Abstraction has 797 states and 1229 transitions. [2025-03-08 06:25:28,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:28,685 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1229 transitions. [2025-03-08 06:25:28,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 06:25:28,686 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:28,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, 1] [2025-03-08 06:25:28,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:25:28,687 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:25:28,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:28,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1860336837, now seen corresponding path program 1 times [2025-03-08 06:25:28,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:28,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053009511] [2025-03-08 06:25:28,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:28,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:28,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 06:25:28,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 06:25:28,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:28,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:28,746 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-08 06:25:28,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:28,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053009511] [2025-03-08 06:25:28,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053009511] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:28,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:28,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:25:28,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385005856] [2025-03-08 06:25:28,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:28,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:25:28,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:28,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:25:28,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:25:28,748 INFO L87 Difference]: Start difference. First operand 797 states and 1229 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:28,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:28,782 INFO L93 Difference]: Finished difference Result 2028 states and 3164 transitions. [2025-03-08 06:25:28,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:25:28,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-08 06:25:28,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:28,788 INFO L225 Difference]: With dead ends: 2028 [2025-03-08 06:25:28,789 INFO L226 Difference]: Without dead ends: 1377 [2025-03-08 06:25:28,790 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-08 06:25:28,791 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 83 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:28,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 470 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:25:28,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2025-03-08 06:25:28,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 1375. [2025-03-08 06:25:28,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1375 states, 1374 states have (on average 1.5363901018922852) internal successors, (2111), 1374 states have internal predecessors, (2111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:28,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 2111 transitions. [2025-03-08 06:25:28,817 INFO L78 Accepts]: Start accepts. Automaton has 1375 states and 2111 transitions. Word has length 78 [2025-03-08 06:25:28,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:28,817 INFO L471 AbstractCegarLoop]: Abstraction has 1375 states and 2111 transitions. [2025-03-08 06:25:28,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:28,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 2111 transitions. [2025-03-08 06:25:28,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 06:25:28,819 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:28,819 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-08 06:25:28,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:25:28,819 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:25:28,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:28,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1861498686, now seen corresponding path program 1 times [2025-03-08 06:25:28,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:28,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345094606] [2025-03-08 06:25:28,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:28,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:28,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 06:25:28,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 06:25:28,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:28,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:29,067 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-08 06:25:29,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:29,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345094606] [2025-03-08 06:25:29,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345094606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:29,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:29,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 06:25:29,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386126042] [2025-03-08 06:25:29,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:29,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:25:29,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:29,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:25:29,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:25:29,069 INFO L87 Difference]: Start difference. First operand 1375 states and 2111 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:29,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:29,224 INFO L93 Difference]: Finished difference Result 2606 states and 4024 transitions. [2025-03-08 06:25:29,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 06:25:29,224 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-08 06:25:29,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:29,228 INFO L225 Difference]: With dead ends: 2606 [2025-03-08 06:25:29,228 INFO L226 Difference]: Without dead ends: 1377 [2025-03-08 06:25:29,230 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-08 06:25:29,230 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 369 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:29,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 765 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:25:29,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2025-03-08 06:25:29,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 1375. [2025-03-08 06:25:29,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1375 states, 1374 states have (on average 1.532023289665211) internal successors, (2105), 1374 states have internal predecessors, (2105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:29,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 2105 transitions. [2025-03-08 06:25:29,254 INFO L78 Accepts]: Start accepts. Automaton has 1375 states and 2105 transitions. Word has length 78 [2025-03-08 06:25:29,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:29,254 INFO L471 AbstractCegarLoop]: Abstraction has 1375 states and 2105 transitions. [2025-03-08 06:25:29,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:29,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 2105 transitions. [2025-03-08 06:25:29,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 06:25:29,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:29,255 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-08 06:25:29,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:25:29,255 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:25:29,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:29,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1334454968, now seen corresponding path program 1 times [2025-03-08 06:25:29,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:29,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856803374] [2025-03-08 06:25:29,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:29,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:29,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 06:25:29,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 06:25:29,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:29,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:29,373 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-08 06:25:29,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:29,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856803374] [2025-03-08 06:25:29,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856803374] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:29,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:29,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 06:25:29,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289225599] [2025-03-08 06:25:29,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:29,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:25:29,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:29,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:25:29,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:25:29,374 INFO L87 Difference]: Start difference. First operand 1375 states and 2105 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:29,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:29,509 INFO L93 Difference]: Finished difference Result 2531 states and 3895 transitions. [2025-03-08 06:25:29,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 06:25:29,510 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-08 06:25:29,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:29,516 INFO L225 Difference]: With dead ends: 2531 [2025-03-08 06:25:29,516 INFO L226 Difference]: Without dead ends: 2306 [2025-03-08 06:25:29,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 06:25:29,518 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 1082 mSDsluCounter, 1283 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1082 SdHoareTripleChecker+Valid, 1587 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:29,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1082 Valid, 1587 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:25:29,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2306 states. [2025-03-08 06:25:29,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2306 to 1609. [2025-03-08 06:25:29,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1609 states, 1608 states have (on average 1.5348258706467661) internal successors, (2468), 1608 states have internal predecessors, (2468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:29,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 2468 transitions. [2025-03-08 06:25:29,551 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 2468 transitions. Word has length 78 [2025-03-08 06:25:29,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:29,551 INFO L471 AbstractCegarLoop]: Abstraction has 1609 states and 2468 transitions. [2025-03-08 06:25:29,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:29,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 2468 transitions. [2025-03-08 06:25:29,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 06:25:29,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:29,552 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-08 06:25:29,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:25:29,552 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:25:29,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:29,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1840639618, now seen corresponding path program 1 times [2025-03-08 06:25:29,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:29,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349175429] [2025-03-08 06:25:29,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:29,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:29,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 06:25:29,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 06:25:29,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:29,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:29,637 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-08 06:25:29,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:29,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349175429] [2025-03-08 06:25:29,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349175429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:29,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:29,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:25:29,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915340246] [2025-03-08 06:25:29,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:29,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:25:29,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:29,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:25:29,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:25:29,638 INFO L87 Difference]: Start difference. First operand 1609 states and 2468 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-08 06:25:29,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:29,803 INFO L93 Difference]: Finished difference Result 4698 states and 7251 transitions. [2025-03-08 06:25:29,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:25:29,804 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-08 06:25:29,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:29,812 INFO L225 Difference]: With dead ends: 4698 [2025-03-08 06:25:29,812 INFO L226 Difference]: Without dead ends: 3127 [2025-03-08 06:25:29,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:25:29,814 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 810 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 810 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:29,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [810 Valid, 178 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:25:29,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3127 states. [2025-03-08 06:25:29,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3127 to 3125. [2025-03-08 06:25:29,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3125 states, 3124 states have (on average 1.5345710627400768) internal successors, (4794), 3124 states have internal predecessors, (4794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:29,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 4794 transitions. [2025-03-08 06:25:29,875 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 4794 transitions. Word has length 79 [2025-03-08 06:25:29,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:29,875 INFO L471 AbstractCegarLoop]: Abstraction has 3125 states and 4794 transitions. [2025-03-08 06:25:29,875 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-08 06:25:29,875 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 4794 transitions. [2025-03-08 06:25:29,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-08 06:25:29,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:29,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] [2025-03-08 06:25:29,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 06:25:29,877 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:25:29,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:29,878 INFO L85 PathProgramCache]: Analyzing trace with hash 799942618, now seen corresponding path program 1 times [2025-03-08 06:25:29,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:29,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983334432] [2025-03-08 06:25:29,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:29,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:29,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 06:25:29,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 06:25:29,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:29,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:29,976 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-08 06:25:29,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:29,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983334432] [2025-03-08 06:25:29,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983334432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:29,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:29,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:25:29,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188252816] [2025-03-08 06:25:29,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:29,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:25:29,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:29,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:25:29,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:25:29,978 INFO L87 Difference]: Start difference. First operand 3125 states and 4794 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-08 06:25:30,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:30,114 INFO L93 Difference]: Finished difference Result 6200 states and 9535 transitions. [2025-03-08 06:25:30,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:25:30,114 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-08 06:25:30,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:30,122 INFO L225 Difference]: With dead ends: 6200 [2025-03-08 06:25:30,123 INFO L226 Difference]: Without dead ends: 3125 [2025-03-08 06:25:30,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:25:30,127 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 517 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:30,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 134 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:25:30,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3125 states. [2025-03-08 06:25:30,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3125 to 3125. [2025-03-08 06:25:30,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3125 states, 3124 states have (on average 1.517605633802817) internal successors, (4741), 3124 states have internal predecessors, (4741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:30,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 4741 transitions. [2025-03-08 06:25:30,176 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 4741 transitions. Word has length 80 [2025-03-08 06:25:30,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:30,176 INFO L471 AbstractCegarLoop]: Abstraction has 3125 states and 4741 transitions. [2025-03-08 06:25:30,177 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-08 06:25:30,177 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 4741 transitions. [2025-03-08 06:25:30,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 06:25:30,178 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:30,178 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:25:30,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 06:25:30,178 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:25:30,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:30,179 INFO L85 PathProgramCache]: Analyzing trace with hash -648103130, now seen corresponding path program 1 times [2025-03-08 06:25:30,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:30,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618492951] [2025-03-08 06:25:30,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:30,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:30,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 06:25:30,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 06:25:30,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:30,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:30,278 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-08 06:25:30,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:30,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618492951] [2025-03-08 06:25:30,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618492951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:30,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:30,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:25:30,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998475833] [2025-03-08 06:25:30,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:30,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:25:30,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:30,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:25:30,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:25:30,279 INFO L87 Difference]: Start difference. First operand 3125 states and 4741 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-08 06:25:30,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:30,396 INFO L93 Difference]: Finished difference Result 6196 states and 9425 transitions. [2025-03-08 06:25:30,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:25:30,397 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-08 06:25:30,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:30,405 INFO L225 Difference]: With dead ends: 6196 [2025-03-08 06:25:30,405 INFO L226 Difference]: Without dead ends: 3125 [2025-03-08 06:25:30,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:25:30,409 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 499 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:30,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 142 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:25:30,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3125 states. [2025-03-08 06:25:30,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3125 to 3125. [2025-03-08 06:25:30,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3125 states, 3124 states have (on average 1.500640204865557) internal successors, (4688), 3124 states have internal predecessors, (4688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:30,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 4688 transitions. [2025-03-08 06:25:30,455 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 4688 transitions. Word has length 81 [2025-03-08 06:25:30,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:30,455 INFO L471 AbstractCegarLoop]: Abstraction has 3125 states and 4688 transitions. [2025-03-08 06:25:30,455 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-08 06:25:30,455 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 4688 transitions. [2025-03-08 06:25:30,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-08 06:25:30,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:30,457 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:25:30,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 06:25:30,457 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:25:30,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:30,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1645540534, now seen corresponding path program 1 times [2025-03-08 06:25:30,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:30,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370428886] [2025-03-08 06:25:30,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:30,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:30,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 06:25:30,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 06:25:30,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:30,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:30,527 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-08 06:25:30,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:30,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370428886] [2025-03-08 06:25:30,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370428886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:30,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:30,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:25:30,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103000913] [2025-03-08 06:25:30,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:30,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:25:30,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:30,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:25:30,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:25:30,529 INFO L87 Difference]: Start difference. First operand 3125 states and 4688 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-08 06:25:30,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:30,639 INFO L93 Difference]: Finished difference Result 6208 states and 9333 transitions. [2025-03-08 06:25:30,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:25:30,639 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-08 06:25:30,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:30,646 INFO L225 Difference]: With dead ends: 6208 [2025-03-08 06:25:30,647 INFO L226 Difference]: Without dead ends: 3125 [2025-03-08 06:25:30,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:25:30,677 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 527 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:30,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 118 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:25:30,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3125 states. [2025-03-08 06:25:30,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3125 to 3125. [2025-03-08 06:25:30,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3125 states, 3124 states have (on average 1.483674775928297) internal successors, (4635), 3124 states have internal predecessors, (4635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:30,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 4635 transitions. [2025-03-08 06:25:30,718 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 4635 transitions. Word has length 82 [2025-03-08 06:25:30,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:30,718 INFO L471 AbstractCegarLoop]: Abstraction has 3125 states and 4635 transitions. [2025-03-08 06:25:30,718 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-08 06:25:30,718 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 4635 transitions. [2025-03-08 06:25:30,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-08 06:25:30,719 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:30,719 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-08 06:25:30,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 06:25:30,719 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:25:30,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:30,720 INFO L85 PathProgramCache]: Analyzing trace with hash 354764674, now seen corresponding path program 1 times [2025-03-08 06:25:30,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:30,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235219813] [2025-03-08 06:25:30,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:30,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:30,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 06:25:30,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 06:25:30,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:30,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:30,794 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-08 06:25:30,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:30,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235219813] [2025-03-08 06:25:30,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235219813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:30,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:30,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:25:30,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003794939] [2025-03-08 06:25:30,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:30,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:25:30,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:30,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:25:30,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:25:30,796 INFO L87 Difference]: Start difference. First operand 3125 states and 4635 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:30,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:30,905 INFO L93 Difference]: Finished difference Result 6204 states and 9223 transitions. [2025-03-08 06:25:30,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:25:30,906 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-03-08 06:25:30,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:30,913 INFO L225 Difference]: With dead ends: 6204 [2025-03-08 06:25:30,913 INFO L226 Difference]: Without dead ends: 3125 [2025-03-08 06:25:30,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:25:30,917 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 509 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:30,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 126 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:25:30,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3125 states. [2025-03-08 06:25:30,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3125 to 3125. [2025-03-08 06:25:30,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3125 states, 3124 states have (on average 1.466709346991037) internal successors, (4582), 3124 states have internal predecessors, (4582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:30,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 4582 transitions. [2025-03-08 06:25:30,961 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 4582 transitions. Word has length 83 [2025-03-08 06:25:30,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:30,961 INFO L471 AbstractCegarLoop]: Abstraction has 3125 states and 4582 transitions. [2025-03-08 06:25:30,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:30,962 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 4582 transitions. [2025-03-08 06:25:30,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-08 06:25:30,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:30,963 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-08 06:25:30,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 06:25:30,964 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:25:30,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:30,964 INFO L85 PathProgramCache]: Analyzing trace with hash -336030318, now seen corresponding path program 1 times [2025-03-08 06:25:30,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:30,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038385914] [2025-03-08 06:25:30,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:30,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:30,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-08 06:25:31,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-08 06:25:31,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:31,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:31,392 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-08 06:25:31,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:31,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038385914] [2025-03-08 06:25:31,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038385914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:31,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:31,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 06:25:31,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657938617] [2025-03-08 06:25:31,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:31,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 06:25:31,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:31,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 06:25:31,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:25:31,394 INFO L87 Difference]: Start difference. First operand 3125 states and 4582 transitions. Second operand has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 12 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-08 06:25:31,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:31,934 INFO L93 Difference]: Finished difference Result 9175 states and 13438 transitions. [2025-03-08 06:25:31,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 06:25:31,935 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 12 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-08 06:25:31,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:31,946 INFO L225 Difference]: With dead ends: 9175 [2025-03-08 06:25:31,946 INFO L226 Difference]: Without dead ends: 6217 [2025-03-08 06:25:31,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2025-03-08 06:25:31,953 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 608 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 608 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:31,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [608 Valid, 565 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:25:31,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6217 states. [2025-03-08 06:25:32,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6217 to 3125. [2025-03-08 06:25:32,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3125 states, 3124 states have (on average 1.4638284250960307) internal successors, (4573), 3124 states have internal predecessors, (4573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:32,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 4573 transitions. [2025-03-08 06:25:32,036 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 4573 transitions. Word has length 84 [2025-03-08 06:25:32,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:32,037 INFO L471 AbstractCegarLoop]: Abstraction has 3125 states and 4573 transitions. [2025-03-08 06:25:32,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 12 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-08 06:25:32,037 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 4573 transitions. [2025-03-08 06:25:32,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-08 06:25:32,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:32,038 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-08 06:25:32,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 06:25:32,038 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:25:32,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:32,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1427493388, now seen corresponding path program 1 times [2025-03-08 06:25:32,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:32,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604352419] [2025-03-08 06:25:32,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:32,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:32,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-08 06:25:32,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-08 06:25:32,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:32,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:32,357 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-08 06:25:32,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:32,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604352419] [2025-03-08 06:25:32,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604352419] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:32,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:32,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 06:25:32,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169870035] [2025-03-08 06:25:32,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:32,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 06:25:32,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:32,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 06:25:32,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 06:25:32,359 INFO L87 Difference]: Start difference. First operand 3125 states and 4573 transitions. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 9 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-08 06:25:32,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:32,759 INFO L93 Difference]: Finished difference Result 7750 states and 11315 transitions. [2025-03-08 06:25:32,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 06:25:32,759 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 9 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-08 06:25:32,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:32,766 INFO L225 Difference]: With dead ends: 7750 [2025-03-08 06:25:32,766 INFO L226 Difference]: Without dead ends: 4747 [2025-03-08 06:25:32,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2025-03-08 06:25:32,771 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 1155 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1155 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:32,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1155 Valid, 502 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:25:32,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4747 states. [2025-03-08 06:25:32,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4747 to 3125. [2025-03-08 06:25:32,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3125 states, 3124 states have (on average 1.4628681177976952) internal successors, (4570), 3124 states have internal predecessors, (4570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:32,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 4570 transitions. [2025-03-08 06:25:32,829 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 4570 transitions. Word has length 85 [2025-03-08 06:25:32,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:32,830 INFO L471 AbstractCegarLoop]: Abstraction has 3125 states and 4570 transitions. [2025-03-08 06:25:32,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 9 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-08 06:25:32,831 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 4570 transitions. [2025-03-08 06:25:32,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-08 06:25:32,832 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:32,832 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-08 06:25:32,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 06:25:32,832 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:25:32,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:32,832 INFO L85 PathProgramCache]: Analyzing trace with hash -535397612, now seen corresponding path program 1 times [2025-03-08 06:25:32,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:32,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179957037] [2025-03-08 06:25:32,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:32,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:32,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-08 06:25:32,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-08 06:25:32,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:32,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:33,166 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-08 06:25:33,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:33,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179957037] [2025-03-08 06:25:33,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179957037] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:33,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:33,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 06:25:33,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870716746] [2025-03-08 06:25:33,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:33,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 06:25:33,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:33,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 06:25:33,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:25:33,167 INFO L87 Difference]: Start difference. First operand 3125 states and 4570 transitions. Second operand has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 12 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-08 06:25:33,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:33,675 INFO L93 Difference]: Finished difference Result 9100 states and 13306 transitions. [2025-03-08 06:25:33,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 06:25:33,676 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 12 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-08 06:25:33,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:33,685 INFO L225 Difference]: With dead ends: 9100 [2025-03-08 06:25:33,685 INFO L226 Difference]: Without dead ends: 6187 [2025-03-08 06:25:33,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2025-03-08 06:25:33,690 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 837 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 837 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:33,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [837 Valid, 703 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:25:33,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6187 states. [2025-03-08 06:25:33,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6187 to 3125. [2025-03-08 06:25:33,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3125 states, 3124 states have (on average 1.459346991037132) internal successors, (4559), 3124 states have internal predecessors, (4559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:33,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 4559 transitions. [2025-03-08 06:25:33,746 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 4559 transitions. Word has length 85 [2025-03-08 06:25:33,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:33,746 INFO L471 AbstractCegarLoop]: Abstraction has 3125 states and 4559 transitions. [2025-03-08 06:25:33,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 12 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-08 06:25:33,746 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 4559 transitions. [2025-03-08 06:25:33,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 06:25:33,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:33,747 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-08 06:25:33,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 06:25:33,748 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:25:33,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:33,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1943153049, now seen corresponding path program 1 times [2025-03-08 06:25:33,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:33,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545623029] [2025-03-08 06:25:33,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:33,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:33,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 06:25:33,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 06:25:33,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:33,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:33,984 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-08 06:25:33,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:33,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545623029] [2025-03-08 06:25:33,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545623029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:33,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:33,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:25:33,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142715481] [2025-03-08 06:25:33,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:33,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:25:33,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:33,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:25:33,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:25:33,985 INFO L87 Difference]: Start difference. First operand 3125 states and 4559 transitions. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 8 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-08 06:25:34,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:34,297 INFO L93 Difference]: Finished difference Result 9006 states and 13200 transitions. [2025-03-08 06:25:34,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:25:34,297 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 8 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-08 06:25:34,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:34,306 INFO L225 Difference]: With dead ends: 9006 [2025-03-08 06:25:34,307 INFO L226 Difference]: Without dead ends: 6038 [2025-03-08 06:25:34,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-03-08 06:25:34,311 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 946 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 946 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:34,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [946 Valid, 486 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:25:34,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6038 states. [2025-03-08 06:25:34,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6038 to 3125. [2025-03-08 06:25:34,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3125 states, 3124 states have (on average 1.4590268886043534) internal successors, (4558), 3124 states have internal predecessors, (4558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:34,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 4558 transitions. [2025-03-08 06:25:34,362 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 4558 transitions. Word has length 86 [2025-03-08 06:25:34,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:34,362 INFO L471 AbstractCegarLoop]: Abstraction has 3125 states and 4558 transitions. [2025-03-08 06:25:34,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 8 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-08 06:25:34,363 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 4558 transitions. [2025-03-08 06:25:34,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-08 06:25:34,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:34,364 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-08 06:25:34,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 06:25:34,364 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:25:34,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:34,364 INFO L85 PathProgramCache]: Analyzing trace with hash -497212460, now seen corresponding path program 1 times [2025-03-08 06:25:34,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:34,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257238926] [2025-03-08 06:25:34,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:34,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:34,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-08 06:25:34,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 06:25:34,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:34,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:34,602 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-08 06:25:34,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:34,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257238926] [2025-03-08 06:25:34,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257238926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:34,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:34,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 06:25:34,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132487895] [2025-03-08 06:25:34,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:34,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 06:25:34,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:34,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 06:25:34,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 06:25:34,603 INFO L87 Difference]: Start difference. First operand 3125 states and 4558 transitions. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 9 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-08 06:25:35,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:35,150 INFO L93 Difference]: Finished difference Result 9220 states and 13456 transitions. [2025-03-08 06:25:35,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 06:25:35,150 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 9 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-08 06:25:35,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:35,159 INFO L225 Difference]: With dead ends: 9220 [2025-03-08 06:25:35,160 INFO L226 Difference]: Without dead ends: 6232 [2025-03-08 06:25:35,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-03-08 06:25:35,164 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 576 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:35,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 801 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:25:35,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6232 states. [2025-03-08 06:25:35,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6232 to 3125. [2025-03-08 06:25:35,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3125 states, 3124 states have (on average 1.4571062740076826) internal successors, (4552), 3124 states have internal predecessors, (4552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:35,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 4552 transitions. [2025-03-08 06:25:35,230 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 4552 transitions. Word has length 87 [2025-03-08 06:25:35,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:35,230 INFO L471 AbstractCegarLoop]: Abstraction has 3125 states and 4552 transitions. [2025-03-08 06:25:35,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 9 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-08 06:25:35,230 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 4552 transitions. [2025-03-08 06:25:35,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 06:25:35,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:35,231 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-08 06:25:35,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 06:25:35,232 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:25:35,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:35,232 INFO L85 PathProgramCache]: Analyzing trace with hash 312577193, now seen corresponding path program 1 times [2025-03-08 06:25:35,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:35,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447068925] [2025-03-08 06:25:35,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:35,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:35,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 06:25:35,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 06:25:35,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:35,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:37,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:25:37,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:37,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447068925] [2025-03-08 06:25:37,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447068925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:37,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:37,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2025-03-08 06:25:37,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231863292] [2025-03-08 06:25:37,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:37,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-08 06:25:37,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:37,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-08 06:25:37,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1025, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 06:25:37,157 INFO L87 Difference]: Start difference. First operand 3125 states and 4552 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 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-08 06:25:41,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:41,955 INFO L93 Difference]: Finished difference Result 8416 states and 12303 transitions. [2025-03-08 06:25:41,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-08 06:25:41,955 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 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-08 06:25:41,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:41,967 INFO L225 Difference]: With dead ends: 8416 [2025-03-08 06:25:41,967 INFO L226 Difference]: Without dead ends: 7967 [2025-03-08 06:25:41,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=569, Invalid=3337, Unknown=0, NotChecked=0, Total=3906 [2025-03-08 06:25:41,970 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 1680 mSDsluCounter, 9734 mSDsCounter, 0 mSdLazyCounter, 6603 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1680 SdHoareTripleChecker+Valid, 10261 SdHoareTripleChecker+Invalid, 6623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 6603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:41,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1680 Valid, 10261 Invalid, 6623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 6603 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-08 06:25:41,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7967 states. [2025-03-08 06:25:42,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7967 to 3160. [2025-03-08 06:25:42,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3160 states, 3159 states have (on average 1.4558404558404558) internal successors, (4599), 3159 states have internal predecessors, (4599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:42,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3160 states to 3160 states and 4599 transitions. [2025-03-08 06:25:42,016 INFO L78 Accepts]: Start accepts. Automaton has 3160 states and 4599 transitions. Word has length 88 [2025-03-08 06:25:42,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:42,016 INFO L471 AbstractCegarLoop]: Abstraction has 3160 states and 4599 transitions. [2025-03-08 06:25:42,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 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-08 06:25:42,017 INFO L276 IsEmpty]: Start isEmpty. Operand 3160 states and 4599 transitions. [2025-03-08 06:25:42,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 06:25:42,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:42,018 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-08 06:25:42,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 06:25:42,018 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:25:42,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:42,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1131707089, now seen corresponding path program 1 times [2025-03-08 06:25:42,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:42,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123814281] [2025-03-08 06:25:42,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:42,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:42,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 06:25:42,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 06:25:42,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:42,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:42,472 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-08 06:25:42,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:42,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123814281] [2025-03-08 06:25:42,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123814281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:42,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:42,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 06:25:42,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128573702] [2025-03-08 06:25:42,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:42,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 06:25:42,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:42,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 06:25:42,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:25:42,473 INFO L87 Difference]: Start difference. First operand 3160 states and 4599 transitions. Second operand has 13 states, 13 states have (on average 6.769230769230769) 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-08 06:25:42,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:42,963 INFO L93 Difference]: Finished difference Result 7042 states and 10300 transitions. [2025-03-08 06:25:42,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 06:25:42,963 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.769230769230769) 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-08 06:25:42,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:42,971 INFO L225 Difference]: With dead ends: 7042 [2025-03-08 06:25:42,971 INFO L226 Difference]: Without dead ends: 6089 [2025-03-08 06:25:42,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-03-08 06:25:42,974 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 990 mSDsluCounter, 1056 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 990 SdHoareTripleChecker+Valid, 1236 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:42,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [990 Valid, 1236 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:25:42,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6089 states. [2025-03-08 06:25:43,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6089 to 3122. [2025-03-08 06:25:43,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3122 states, 3121 states have (on average 1.4546619673181673) internal successors, (4540), 3121 states have internal predecessors, (4540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:43,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 4540 transitions. [2025-03-08 06:25:43,029 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 4540 transitions. Word has length 88 [2025-03-08 06:25:43,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:43,029 INFO L471 AbstractCegarLoop]: Abstraction has 3122 states and 4540 transitions. [2025-03-08 06:25:43,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.769230769230769) 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-08 06:25:43,029 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 4540 transitions. [2025-03-08 06:25:43,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 06:25:43,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:43,030 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-08 06:25:43,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 06:25:43,030 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:25:43,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:43,031 INFO L85 PathProgramCache]: Analyzing trace with hash -682355463, now seen corresponding path program 1 times [2025-03-08 06:25:43,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:43,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114758844] [2025-03-08 06:25:43,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:43,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:43,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 06:25:43,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 06:25:43,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:43,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:43,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-08 06:25:43,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:43,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114758844] [2025-03-08 06:25:43,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114758844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:43,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:43,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 06:25:43,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901986503] [2025-03-08 06:25:43,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:43,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 06:25:43,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:43,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 06:25:43,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-08 06:25:43,493 INFO L87 Difference]: Start difference. First operand 3122 states and 4540 transitions. Second operand has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 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-08 06:25:44,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:44,065 INFO L93 Difference]: Finished difference Result 7888 states and 11532 transitions. [2025-03-08 06:25:44,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 06:25:44,066 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 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-08 06:25:44,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:44,073 INFO L225 Difference]: With dead ends: 7888 [2025-03-08 06:25:44,074 INFO L226 Difference]: Without dead ends: 6930 [2025-03-08 06:25:44,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2025-03-08 06:25:44,076 INFO L435 NwaCegarLoop]: 389 mSDtfsCounter, 993 mSDsluCounter, 2953 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 993 SdHoareTripleChecker+Valid, 3342 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:44,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [993 Valid, 3342 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:25:44,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6930 states. [2025-03-08 06:25:44,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6930 to 3065. [2025-03-08 06:25:44,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3065 states, 3064 states have (on average 1.456266318537859) internal successors, (4462), 3064 states have internal predecessors, (4462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:44,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3065 states to 3065 states and 4462 transitions. [2025-03-08 06:25:44,118 INFO L78 Accepts]: Start accepts. Automaton has 3065 states and 4462 transitions. Word has length 88 [2025-03-08 06:25:44,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:44,118 INFO L471 AbstractCegarLoop]: Abstraction has 3065 states and 4462 transitions. [2025-03-08 06:25:44,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 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-08 06:25:44,118 INFO L276 IsEmpty]: Start isEmpty. Operand 3065 states and 4462 transitions. [2025-03-08 06:25:44,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 06:25:44,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:44,119 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-08 06:25:44,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 06:25:44,119 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:25:44,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:44,119 INFO L85 PathProgramCache]: Analyzing trace with hash -536192223, now seen corresponding path program 1 times [2025-03-08 06:25:44,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:44,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631504402] [2025-03-08 06:25:44,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:44,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:44,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 06:25:44,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 06:25:44,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:44,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:44,725 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-08 06:25:44,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:44,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631504402] [2025-03-08 06:25:44,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631504402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:44,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:44,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-08 06:25:44,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023881002] [2025-03-08 06:25:44,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:44,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 06:25:44,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:44,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 06:25:44,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2025-03-08 06:25:44,727 INFO L87 Difference]: Start difference. First operand 3065 states and 4462 transitions. Second operand has 17 states, 17 states have (on average 5.176470588235294) internal successors, (88), 17 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-08 06:25:45,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:45,564 INFO L93 Difference]: Finished difference Result 4880 states and 7121 transitions. [2025-03-08 06:25:45,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 06:25:45,566 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.176470588235294) internal successors, (88), 17 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-08 06:25:45,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:45,570 INFO L225 Difference]: With dead ends: 4880 [2025-03-08 06:25:45,570 INFO L226 Difference]: Without dead ends: 3964 [2025-03-08 06:25:45,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=211, Invalid=659, Unknown=0, NotChecked=0, Total=870 [2025-03-08 06:25:45,572 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 1052 mSDsluCounter, 2122 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1052 SdHoareTripleChecker+Valid, 2374 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:45,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1052 Valid, 2374 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:25:45,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3964 states. [2025-03-08 06:25:45,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3964 to 3065. [2025-03-08 06:25:45,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3065 states, 3064 states have (on average 1.455939947780679) internal successors, (4461), 3064 states have internal predecessors, (4461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:45,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3065 states to 3065 states and 4461 transitions. [2025-03-08 06:25:45,597 INFO L78 Accepts]: Start accepts. Automaton has 3065 states and 4461 transitions. Word has length 88 [2025-03-08 06:25:45,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:45,597 INFO L471 AbstractCegarLoop]: Abstraction has 3065 states and 4461 transitions. [2025-03-08 06:25:45,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.176470588235294) internal successors, (88), 17 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-08 06:25:45,597 INFO L276 IsEmpty]: Start isEmpty. Operand 3065 states and 4461 transitions. [2025-03-08 06:25:45,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 06:25:45,598 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:45,598 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-08 06:25:45,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 06:25:45,599 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:25:45,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:45,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1363777766, now seen corresponding path program 1 times [2025-03-08 06:25:45,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:45,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523981719] [2025-03-08 06:25:45,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:45,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:45,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 06:25:45,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 06:25:45,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:45,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:45,972 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-08 06:25:45,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:45,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523981719] [2025-03-08 06:25:45,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523981719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:45,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:45,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 06:25:45,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468679293] [2025-03-08 06:25:45,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:45,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 06:25:45,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:45,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 06:25:45,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:25:45,974 INFO L87 Difference]: Start difference. First operand 3065 states and 4461 transitions. Second operand has 13 states, 13 states have (on average 6.846153846153846) internal successors, (89), 13 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-08 06:25:46,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:46,438 INFO L93 Difference]: Finished difference Result 6880 states and 10072 transitions. [2025-03-08 06:25:46,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 06:25:46,438 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.846153846153846) internal successors, (89), 13 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-08 06:25:46,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:46,444 INFO L225 Difference]: With dead ends: 6880 [2025-03-08 06:25:46,444 INFO L226 Difference]: Without dead ends: 5982 [2025-03-08 06:25:46,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-03-08 06:25:46,446 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 798 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 798 SdHoareTripleChecker+Valid, 1329 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:46,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [798 Valid, 1329 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:25:46,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5982 states. [2025-03-08 06:25:46,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5982 to 3048. [2025-03-08 06:25:46,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3048 states, 3047 states have (on average 1.455201837873318) internal successors, (4434), 3047 states have internal predecessors, (4434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:46,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3048 states to 3048 states and 4434 transitions. [2025-03-08 06:25:46,477 INFO L78 Accepts]: Start accepts. Automaton has 3048 states and 4434 transitions. Word has length 89 [2025-03-08 06:25:46,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:46,477 INFO L471 AbstractCegarLoop]: Abstraction has 3048 states and 4434 transitions. [2025-03-08 06:25:46,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.846153846153846) internal successors, (89), 13 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-08 06:25:46,477 INFO L276 IsEmpty]: Start isEmpty. Operand 3048 states and 4434 transitions. [2025-03-08 06:25:46,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 06:25:46,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:46,478 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-08 06:25:46,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 06:25:46,478 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:25:46,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:46,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1403158557, now seen corresponding path program 1 times [2025-03-08 06:25:46,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:46,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205794394] [2025-03-08 06:25:46,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:46,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:46,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 06:25:46,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 06:25:46,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:46,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:46,564 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-08 06:25:46,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:46,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205794394] [2025-03-08 06:25:46,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205794394] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:46,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:46,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:25:46,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344005480] [2025-03-08 06:25:46,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:46,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:25:46,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:46,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:25:46,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:25:46,565 INFO L87 Difference]: Start difference. First operand 3048 states and 4434 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 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-08 06:25:46,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:46,590 INFO L93 Difference]: Finished difference Result 7237 states and 10602 transitions. [2025-03-08 06:25:46,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:25:46,591 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 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-08 06:25:46,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:46,593 INFO L225 Difference]: With dead ends: 7237 [2025-03-08 06:25:46,593 INFO L226 Difference]: Without dead ends: 4335 [2025-03-08 06:25:46,595 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-08 06:25:46,596 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 90 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:46,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 436 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:25:46,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4335 states. [2025-03-08 06:25:46,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4335 to 4333. [2025-03-08 06:25:46,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4333 states, 4332 states have (on average 1.4531394275161589) internal successors, (6295), 4332 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-08 06:25:46,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4333 states to 4333 states and 6295 transitions. [2025-03-08 06:25:46,650 INFO L78 Accepts]: Start accepts. Automaton has 4333 states and 6295 transitions. Word has length 89 [2025-03-08 06:25:46,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:46,650 INFO L471 AbstractCegarLoop]: Abstraction has 4333 states and 6295 transitions. [2025-03-08 06:25:46,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 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-08 06:25:46,650 INFO L276 IsEmpty]: Start isEmpty. Operand 4333 states and 6295 transitions. [2025-03-08 06:25:46,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 06:25:46,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:46,651 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-08 06:25:46,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 06:25:46,651 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:25:46,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:46,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1435362628, now seen corresponding path program 1 times [2025-03-08 06:25:46,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:46,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500298992] [2025-03-08 06:25:46,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:46,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:46,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 06:25:46,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 06:25:46,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:46,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:46,782 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-08 06:25:46,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:46,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500298992] [2025-03-08 06:25:46,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500298992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:46,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:46,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:25:46,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742477412] [2025-03-08 06:25:46,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:46,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:25:46,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:46,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:25:46,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:25:46,785 INFO L87 Difference]: Start difference. First operand 4333 states and 6295 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 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-08 06:25:46,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:46,808 INFO L93 Difference]: Finished difference Result 4359 states and 6332 transitions. [2025-03-08 06:25:46,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:25:46,809 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 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-08 06:25:46,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:46,812 INFO L225 Difference]: With dead ends: 4359 [2025-03-08 06:25:46,812 INFO L226 Difference]: Without dead ends: 4357 [2025-03-08 06:25:46,812 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-08 06:25:46,813 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 0 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 713 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-08 06:25:46,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 713 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:25:46,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4357 states. [2025-03-08 06:25:46,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4357 to 4357. [2025-03-08 06:25:46,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4357 states, 4356 states have (on average 1.4444444444444444) internal successors, (6292), 4356 states have internal predecessors, (6292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:46,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4357 states to 4357 states and 6292 transitions. [2025-03-08 06:25:46,849 INFO L78 Accepts]: Start accepts. Automaton has 4357 states and 6292 transitions. Word has length 89 [2025-03-08 06:25:46,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:46,849 INFO L471 AbstractCegarLoop]: Abstraction has 4357 states and 6292 transitions. [2025-03-08 06:25:46,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 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-08 06:25:46,850 INFO L276 IsEmpty]: Start isEmpty. Operand 4357 states and 6292 transitions. [2025-03-08 06:25:46,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 06:25:46,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:46,850 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-08 06:25:46,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 06:25:46,851 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:25:46,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:46,851 INFO L85 PathProgramCache]: Analyzing trace with hash -332502542, now seen corresponding path program 1 times [2025-03-08 06:25:46,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:46,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957574984] [2025-03-08 06:25:46,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:46,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:46,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 06:25:46,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 06:25:46,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:46,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:48,322 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-08 06:25:48,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:48,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957574984] [2025-03-08 06:25:48,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957574984] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:48,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:48,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2025-03-08 06:25:48,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662451768] [2025-03-08 06:25:48,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:48,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-08 06:25:48,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:48,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-08 06:25:48,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=961, Unknown=0, NotChecked=0, Total=1056 [2025-03-08 06:25:48,324 INFO L87 Difference]: Start difference. First operand 4357 states and 6292 transitions. Second operand has 33 states, 33 states have (on average 2.696969696969697) internal successors, (89), 33 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-08 06:25:51,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:51,793 INFO L93 Difference]: Finished difference Result 12294 states and 17814 transitions. [2025-03-08 06:25:51,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-08 06:25:51,793 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.696969696969697) internal successors, (89), 33 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-08 06:25:51,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:51,802 INFO L225 Difference]: With dead ends: 12294 [2025-03-08 06:25:51,803 INFO L226 Difference]: Without dead ends: 11177 [2025-03-08 06:25:51,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=560, Invalid=3100, Unknown=0, NotChecked=0, Total=3660 [2025-03-08 06:25:51,807 INFO L435 NwaCegarLoop]: 363 mSDtfsCounter, 1502 mSDsluCounter, 6044 mSDsCounter, 0 mSdLazyCounter, 4294 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1502 SdHoareTripleChecker+Valid, 6407 SdHoareTripleChecker+Invalid, 4307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 4294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:51,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1502 Valid, 6407 Invalid, 4307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 4294 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-08 06:25:51,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11177 states. [2025-03-08 06:25:51,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11177 to 4370. [2025-03-08 06:25:51,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4370 states, 4369 states have (on average 1.4438086518654154) internal successors, (6308), 4369 states have internal predecessors, (6308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:51,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4370 states to 4370 states and 6308 transitions. [2025-03-08 06:25:51,877 INFO L78 Accepts]: Start accepts. Automaton has 4370 states and 6308 transitions. Word has length 89 [2025-03-08 06:25:51,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:51,877 INFO L471 AbstractCegarLoop]: Abstraction has 4370 states and 6308 transitions. [2025-03-08 06:25:51,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.696969696969697) internal successors, (89), 33 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-08 06:25:51,877 INFO L276 IsEmpty]: Start isEmpty. Operand 4370 states and 6308 transitions. [2025-03-08 06:25:51,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 06:25:51,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:51,878 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-08 06:25:51,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 06:25:51,878 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:25:51,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:51,879 INFO L85 PathProgramCache]: Analyzing trace with hash -158302522, now seen corresponding path program 1 times [2025-03-08 06:25:51,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:51,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593568731] [2025-03-08 06:25:51,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:51,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:51,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 06:25:51,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 06:25:51,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:51,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:52,368 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-08 06:25:52,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:52,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593568731] [2025-03-08 06:25:52,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593568731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:52,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:52,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 06:25:52,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599625814] [2025-03-08 06:25:52,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:52,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 06:25:52,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:52,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 06:25:52,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-08 06:25:52,370 INFO L87 Difference]: Start difference. First operand 4370 states and 6308 transitions. Second operand has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 14 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-08 06:25:53,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:53,083 INFO L93 Difference]: Finished difference Result 18402 states and 26712 transitions. [2025-03-08 06:25:53,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 06:25:53,083 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 14 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-08 06:25:53,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:53,099 INFO L225 Difference]: With dead ends: 18402 [2025-03-08 06:25:53,100 INFO L226 Difference]: Without dead ends: 17050 [2025-03-08 06:25:53,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2025-03-08 06:25:53,105 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 810 mSDsluCounter, 3014 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 810 SdHoareTripleChecker+Valid, 3439 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:53,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [810 Valid, 3439 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:25:53,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17050 states. [2025-03-08 06:25:53,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17050 to 4339. [2025-03-08 06:25:53,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4339 states, 4338 states have (on average 1.4449054863992623) internal successors, (6268), 4338 states have internal predecessors, (6268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:53,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4339 states to 4339 states and 6268 transitions. [2025-03-08 06:25:53,205 INFO L78 Accepts]: Start accepts. Automaton has 4339 states and 6268 transitions. Word has length 89 [2025-03-08 06:25:53,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:53,205 INFO L471 AbstractCegarLoop]: Abstraction has 4339 states and 6268 transitions. [2025-03-08 06:25:53,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 14 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-08 06:25:53,205 INFO L276 IsEmpty]: Start isEmpty. Operand 4339 states and 6268 transitions. [2025-03-08 06:25:53,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 06:25:53,205 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:53,205 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-08 06:25:53,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 06:25:53,206 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:25:53,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:53,206 INFO L85 PathProgramCache]: Analyzing trace with hash 831355213, now seen corresponding path program 1 times [2025-03-08 06:25:53,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:53,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429039966] [2025-03-08 06:25:53,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:53,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:53,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 06:25:53,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 06:25:53,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:53,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:53,522 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-08 06:25:53,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:53,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429039966] [2025-03-08 06:25:53,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429039966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:53,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:53,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 06:25:53,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350373678] [2025-03-08 06:25:53,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:53,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 06:25:53,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:53,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 06:25:53,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-08 06:25:53,524 INFO L87 Difference]: Start difference. First operand 4339 states and 6268 transitions. Second operand has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 11 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-08 06:25:53,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:53,825 INFO L93 Difference]: Finished difference Result 9454 states and 13719 transitions. [2025-03-08 06:25:53,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 06:25:53,826 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 11 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-08 06:25:53,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:53,832 INFO L225 Difference]: With dead ends: 9454 [2025-03-08 06:25:53,832 INFO L226 Difference]: Without dead ends: 8317 [2025-03-08 06:25:53,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:25:53,835 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 730 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:53,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 1027 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:25:53,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8317 states. [2025-03-08 06:25:53,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8317 to 4211. [2025-03-08 06:25:53,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4211 states, 4210 states have (on average 1.4465558194774346) internal successors, (6090), 4210 states have internal predecessors, (6090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:53,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4211 states to 4211 states and 6090 transitions. [2025-03-08 06:25:53,885 INFO L78 Accepts]: Start accepts. Automaton has 4211 states and 6090 transitions. Word has length 90 [2025-03-08 06:25:53,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:53,885 INFO L471 AbstractCegarLoop]: Abstraction has 4211 states and 6090 transitions. [2025-03-08 06:25:53,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 11 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-08 06:25:53,885 INFO L276 IsEmpty]: Start isEmpty. Operand 4211 states and 6090 transitions. [2025-03-08 06:25:53,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-08 06:25:53,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:53,887 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, 1] [2025-03-08 06:25:53,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 06:25:53,887 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:25:53,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:53,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1128028138, now seen corresponding path program 1 times [2025-03-08 06:25:53,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:53,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113383685] [2025-03-08 06:25:53,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:53,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:53,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 06:25:53,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 06:25:53,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:53,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:53,949 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-08 06:25:53,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:53,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113383685] [2025-03-08 06:25:53,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113383685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:53,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:53,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:25:53,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280595140] [2025-03-08 06:25:53,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:53,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:25:53,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:53,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:25:53,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:25:53,951 INFO L87 Difference]: Start difference. First operand 4211 states and 6090 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:53,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:53,975 INFO L93 Difference]: Finished difference Result 8841 states and 12831 transitions. [2025-03-08 06:25:53,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:25:53,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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 117 [2025-03-08 06:25:53,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:53,982 INFO L225 Difference]: With dead ends: 8841 [2025-03-08 06:25:53,982 INFO L226 Difference]: Without dead ends: 5915 [2025-03-08 06:25:53,985 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-08 06:25:53,986 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 83 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:53,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 395 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:25:53,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5915 states. [2025-03-08 06:25:54,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5915 to 5697. [2025-03-08 06:25:54,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5697 states, 5696 states have (on average 1.4396067415730338) internal successors, (8200), 5696 states have internal predecessors, (8200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:54,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5697 states to 5697 states and 8200 transitions. [2025-03-08 06:25:54,038 INFO L78 Accepts]: Start accepts. Automaton has 5697 states and 8200 transitions. Word has length 117 [2025-03-08 06:25:54,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:54,038 INFO L471 AbstractCegarLoop]: Abstraction has 5697 states and 8200 transitions. [2025-03-08 06:25:54,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:54,039 INFO L276 IsEmpty]: Start isEmpty. Operand 5697 states and 8200 transitions. [2025-03-08 06:25:54,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 06:25:54,039 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:54,040 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, 1] [2025-03-08 06:25:54,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 06:25:54,040 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:25:54,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:54,041 INFO L85 PathProgramCache]: Analyzing trace with hash 748892462, now seen corresponding path program 1 times [2025-03-08 06:25:54,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:54,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491020520] [2025-03-08 06:25:54,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:54,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:54,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 06:25:54,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 06:25:54,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:54,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:54,124 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-08 06:25:54,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:54,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491020520] [2025-03-08 06:25:54,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491020520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:54,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:54,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:25:54,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154432577] [2025-03-08 06:25:54,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:54,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:25:54,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:54,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:25:54,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:25:54,126 INFO L87 Difference]: Start difference. First operand 5697 states and 8200 transitions. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:54,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:54,387 INFO L93 Difference]: Finished difference Result 15173 states and 22020 transitions. [2025-03-08 06:25:54,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:25:54,388 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2025-03-08 06:25:54,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:54,397 INFO L225 Difference]: With dead ends: 15173 [2025-03-08 06:25:54,397 INFO L226 Difference]: Without dead ends: 9601 [2025-03-08 06:25:54,401 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-08 06:25:54,401 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 873 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 873 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:54,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [873 Valid, 410 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:25:54,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9601 states. [2025-03-08 06:25:54,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9601 to 6183. [2025-03-08 06:25:54,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6183 states, 6182 states have (on average 1.435619540601747) internal successors, (8875), 6182 states have internal predecessors, (8875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:54,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6183 states to 6183 states and 8875 transitions. [2025-03-08 06:25:54,465 INFO L78 Accepts]: Start accepts. Automaton has 6183 states and 8875 transitions. Word has length 119 [2025-03-08 06:25:54,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:54,465 INFO L471 AbstractCegarLoop]: Abstraction has 6183 states and 8875 transitions. [2025-03-08 06:25:54,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:54,466 INFO L276 IsEmpty]: Start isEmpty. Operand 6183 states and 8875 transitions. [2025-03-08 06:25:54,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 06:25:54,466 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:54,466 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, 1] [2025-03-08 06:25:54,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 06:25:54,466 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:25:54,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:54,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1352538514, now seen corresponding path program 1 times [2025-03-08 06:25:54,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:54,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973316933] [2025-03-08 06:25:54,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:54,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:54,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 06:25:54,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 06:25:54,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:54,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:54,552 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-08 06:25:54,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:54,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973316933] [2025-03-08 06:25:54,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973316933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:54,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:54,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:25:54,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147416000] [2025-03-08 06:25:54,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:54,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:25:54,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:54,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:25:54,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:25:54,554 INFO L87 Difference]: Start difference. First operand 6183 states and 8875 transitions. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:54,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:54,782 INFO L93 Difference]: Finished difference Result 24463 states and 35507 transitions. [2025-03-08 06:25:54,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:25:54,782 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2025-03-08 06:25:54,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:54,803 INFO L225 Difference]: With dead ends: 24463 [2025-03-08 06:25:54,803 INFO L226 Difference]: Without dead ends: 18423 [2025-03-08 06:25:54,813 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-08 06:25:54,813 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 1019 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1019 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:54,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1019 Valid, 342 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:25:54,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18423 states. [2025-03-08 06:25:54,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18423 to 13221. [2025-03-08 06:25:54,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13221 states, 13220 states have (on average 1.4364599092284418) internal successors, (18990), 13220 states have internal predecessors, (18990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:54,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13221 states to 13221 states and 18990 transitions. [2025-03-08 06:25:54,964 INFO L78 Accepts]: Start accepts. Automaton has 13221 states and 18990 transitions. Word has length 119 [2025-03-08 06:25:54,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:54,965 INFO L471 AbstractCegarLoop]: Abstraction has 13221 states and 18990 transitions. [2025-03-08 06:25:54,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:54,965 INFO L276 IsEmpty]: Start isEmpty. Operand 13221 states and 18990 transitions. [2025-03-08 06:25:54,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 06:25:54,966 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:54,966 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, 1] [2025-03-08 06:25:54,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 06:25:54,966 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:25:54,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:54,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1006946932, now seen corresponding path program 1 times [2025-03-08 06:25:54,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:54,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024967529] [2025-03-08 06:25:54,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:54,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:54,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 06:25:54,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 06:25:54,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:54,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:55,100 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-08 06:25:55,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:55,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024967529] [2025-03-08 06:25:55,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024967529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:55,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:55,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:25:55,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012098952] [2025-03-08 06:25:55,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:55,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:25:55,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:55,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:25:55,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:25:55,103 INFO L87 Difference]: Start difference. First operand 13221 states and 18990 transitions. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:55,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:55,377 INFO L93 Difference]: Finished difference Result 43777 states and 63052 transitions. [2025-03-08 06:25:55,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:25:55,379 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2025-03-08 06:25:55,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:55,414 INFO L225 Difference]: With dead ends: 43777 [2025-03-08 06:25:55,415 INFO L226 Difference]: Without dead ends: 30699 [2025-03-08 06:25:55,431 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-08 06:25:55,431 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 849 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:55,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [849 Valid, 338 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:25:55,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30699 states. [2025-03-08 06:25:55,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30699 to 28297. [2025-03-08 06:25:55,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28297 states, 28296 states have (on average 1.4355385920271417) internal successors, (40620), 28296 states have internal predecessors, (40620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:55,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28297 states to 28297 states and 40620 transitions. [2025-03-08 06:25:55,699 INFO L78 Accepts]: Start accepts. Automaton has 28297 states and 40620 transitions. Word has length 119 [2025-03-08 06:25:55,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:55,699 INFO L471 AbstractCegarLoop]: Abstraction has 28297 states and 40620 transitions. [2025-03-08 06:25:55,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:55,699 INFO L276 IsEmpty]: Start isEmpty. Operand 28297 states and 40620 transitions. [2025-03-08 06:25:55,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 06:25:55,700 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:55,700 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, 1] [2025-03-08 06:25:55,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-08 06:25:55,700 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:25:55,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:55,701 INFO L85 PathProgramCache]: Analyzing trace with hash 283343116, now seen corresponding path program 1 times [2025-03-08 06:25:55,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:55,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125266505] [2025-03-08 06:25:55,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:55,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:55,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 06:25:55,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 06:25:55,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:55,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:55,823 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-08 06:25:55,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:55,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125266505] [2025-03-08 06:25:55,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125266505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:55,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:55,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:25:55,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086443332] [2025-03-08 06:25:55,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:55,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:25:55,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:55,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:25:55,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:25:55,825 INFO L87 Difference]: Start difference. First operand 28297 states and 40620 transitions. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:56,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:56,171 INFO L93 Difference]: Finished difference Result 98605 states and 142342 transitions. [2025-03-08 06:25:56,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:25:56,171 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2025-03-08 06:25:56,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:56,258 INFO L225 Difference]: With dead ends: 98605 [2025-03-08 06:25:56,258 INFO L226 Difference]: Without dead ends: 70451 [2025-03-08 06:25:56,296 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-08 06:25:56,297 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 934 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 934 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:56,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [934 Valid, 340 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:25:56,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70451 states. [2025-03-08 06:25:56,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70451 to 60449. [2025-03-08 06:25:56,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60449 states, 60448 states have (on average 1.433959767072525) internal successors, (86680), 60448 states have internal predecessors, (86680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:56,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60449 states to 60449 states and 86680 transitions. [2025-03-08 06:25:56,992 INFO L78 Accepts]: Start accepts. Automaton has 60449 states and 86680 transitions. Word has length 119 [2025-03-08 06:25:56,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:56,993 INFO L471 AbstractCegarLoop]: Abstraction has 60449 states and 86680 transitions. [2025-03-08 06:25:56,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:56,993 INFO L276 IsEmpty]: Start isEmpty. Operand 60449 states and 86680 transitions. [2025-03-08 06:25:57,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-08 06:25:57,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:57,002 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, 1] [2025-03-08 06:25:57,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-08 06:25:57,002 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:25:57,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:57,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1519514395, now seen corresponding path program 1 times [2025-03-08 06:25:57,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:57,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079116567] [2025-03-08 06:25:57,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:57,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:57,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 06:25:57,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 06:25:57,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:57,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:57,195 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-08 06:25:57,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:57,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079116567] [2025-03-08 06:25:57,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079116567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:57,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:57,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:25:57,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133952953] [2025-03-08 06:25:57,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:57,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:25:57,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:57,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:25:57,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:25:57,197 INFO L87 Difference]: Start difference. First operand 60449 states and 86680 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:57,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:57,444 INFO L93 Difference]: Finished difference Result 116533 states and 166770 transitions. [2025-03-08 06:25:57,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:25:57,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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-08 06:25:57,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:57,519 INFO L225 Difference]: With dead ends: 116533 [2025-03-08 06:25:57,519 INFO L226 Difference]: Without dead ends: 56221 [2025-03-08 06:25:57,568 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-08 06:25:57,568 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 76 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:57,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 384 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:25:57,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56221 states. [2025-03-08 06:25:58,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56221 to 54959. [2025-03-08 06:25:58,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54959 states, 54958 states have (on average 1.4202663852396376) internal successors, (78055), 54958 states have internal predecessors, (78055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:58,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54959 states to 54959 states and 78055 transitions. [2025-03-08 06:25:58,362 INFO L78 Accepts]: Start accepts. Automaton has 54959 states and 78055 transitions. Word has length 146 [2025-03-08 06:25:58,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:58,363 INFO L471 AbstractCegarLoop]: Abstraction has 54959 states and 78055 transitions. [2025-03-08 06:25:58,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:58,363 INFO L276 IsEmpty]: Start isEmpty. Operand 54959 states and 78055 transitions. [2025-03-08 06:25:58,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-08 06:25:58,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:58,371 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, 1] [2025-03-08 06:25:58,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-08 06:25:58,371 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:25:58,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:58,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1159891492, now seen corresponding path program 1 times [2025-03-08 06:25:58,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:58,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901500607] [2025-03-08 06:25:58,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:58,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:58,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 06:25:58,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 06:25:58,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:58,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:58,484 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-08 06:25:58,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:58,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901500607] [2025-03-08 06:25:58,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901500607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:58,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:58,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:25:58,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742531363] [2025-03-08 06:25:58,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:58,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:25:58,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:58,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:25:58,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:25:58,485 INFO L87 Difference]: Start difference. First operand 54959 states and 78055 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:58,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:58,739 INFO L93 Difference]: Finished difference Result 105595 states and 149577 transitions. [2025-03-08 06:25:58,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:25:58,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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-08 06:25:58,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:58,803 INFO L225 Difference]: With dead ends: 105595 [2025-03-08 06:25:58,803 INFO L226 Difference]: Without dead ends: 50761 [2025-03-08 06:25:58,840 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-08 06:25:58,841 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 69 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:58,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 385 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:25:58,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50761 states. [2025-03-08 06:25:59,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50761 to 49559. [2025-03-08 06:25:59,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49559 states, 49558 states have (on average 1.405524839581904) internal successors, (69655), 49558 states have internal predecessors, (69655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:59,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49559 states to 49559 states and 69655 transitions. [2025-03-08 06:25:59,472 INFO L78 Accepts]: Start accepts. Automaton has 49559 states and 69655 transitions. Word has length 147 [2025-03-08 06:25:59,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:59,472 INFO L471 AbstractCegarLoop]: Abstraction has 49559 states and 69655 transitions. [2025-03-08 06:25:59,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:59,472 INFO L276 IsEmpty]: Start isEmpty. Operand 49559 states and 69655 transitions. [2025-03-08 06:25:59,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 06:25:59,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:59,477 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, 1] [2025-03-08 06:25:59,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-08 06:25:59,477 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:25:59,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:59,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1775608462, now seen corresponding path program 1 times [2025-03-08 06:25:59,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:59,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293086225] [2025-03-08 06:25:59,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:59,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:59,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 06:25:59,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 06:25:59,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:59,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:59,548 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-08 06:25:59,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:59,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293086225] [2025-03-08 06:25:59,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293086225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:59,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:59,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:25:59,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624729436] [2025-03-08 06:25:59,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:59,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:25:59,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:59,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:25:59,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:25:59,549 INFO L87 Difference]: Start difference. First operand 49559 states and 69655 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:59,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:59,908 INFO L93 Difference]: Finished difference Result 94795 states and 132777 transitions. [2025-03-08 06:25:59,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:25:59,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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-08 06:25:59,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:59,959 INFO L225 Difference]: With dead ends: 94795 [2025-03-08 06:25:59,960 INFO L226 Difference]: Without dead ends: 45361 [2025-03-08 06:25:59,987 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-08 06:25:59,987 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 62 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:59,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 386 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:26:00,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45361 states. [2025-03-08 06:26:00,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45361 to 44159. [2025-03-08 06:26:00,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44159 states, 44158 states have (on average 1.3871778613161827) internal successors, (61255), 44158 states have internal predecessors, (61255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:26:00,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44159 states to 44159 states and 61255 transitions. [2025-03-08 06:26:00,395 INFO L78 Accepts]: Start accepts. Automaton has 44159 states and 61255 transitions. Word has length 148 [2025-03-08 06:26:00,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:26:00,395 INFO L471 AbstractCegarLoop]: Abstraction has 44159 states and 61255 transitions. [2025-03-08 06:26:00,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:26:00,395 INFO L276 IsEmpty]: Start isEmpty. Operand 44159 states and 61255 transitions. [2025-03-08 06:26:00,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-08 06:26:00,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:26:00,399 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, 1] [2025-03-08 06:26:00,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-08 06:26:00,399 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:26:00,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:26:00,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1305806063, now seen corresponding path program 1 times [2025-03-08 06:26:00,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:26:00,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180057210] [2025-03-08 06:26:00,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:26:00,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:26:00,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 06:26:00,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 06:26:00,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:26:00,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:26:00,565 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-08 06:26:00,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:26:00,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180057210] [2025-03-08 06:26:00,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180057210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:26:00,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:26:00,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:26:00,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433410653] [2025-03-08 06:26:00,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:26:00,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:26:00,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:26:00,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:26:00,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:26:00,567 INFO L87 Difference]: Start difference. First operand 44159 states and 61255 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:26:00,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:26:00,768 INFO L93 Difference]: Finished difference Result 127827 states and 176297 transitions. [2025-03-08 06:26:00,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:26:00,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 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-08 06:26:00,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:26:00,850 INFO L225 Difference]: With dead ends: 127827 [2025-03-08 06:26:00,850 INFO L226 Difference]: Without dead ends: 83793 [2025-03-08 06:26:00,888 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-08 06:26:00,888 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 55 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:26:00,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 387 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:26:00,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83793 states. [2025-03-08 06:26:01,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83793 to 78191. [2025-03-08 06:26:01,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78191 states, 78190 states have (on average 1.3706995779511446) internal successors, (107175), 78190 states have internal predecessors, (107175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:26:01,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78191 states to 78191 states and 107175 transitions. [2025-03-08 06:26:01,846 INFO L78 Accepts]: Start accepts. Automaton has 78191 states and 107175 transitions. Word has length 149 [2025-03-08 06:26:01,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:26:01,847 INFO L471 AbstractCegarLoop]: Abstraction has 78191 states and 107175 transitions. [2025-03-08 06:26:01,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:26:01,847 INFO L276 IsEmpty]: Start isEmpty. Operand 78191 states and 107175 transitions. [2025-03-08 06:26:01,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 06:26:01,852 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:26:01,853 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, 1] [2025-03-08 06:26:01,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-08 06:26:01,853 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:26:01,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:26:01,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1207923714, now seen corresponding path program 1 times [2025-03-08 06:26:01,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:26:01,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511853536] [2025-03-08 06:26:01,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:26:01,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:26:01,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 06:26:01,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 06:26:01,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:26:01,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:26:02,338 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-08 06:26:02,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:26:02,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511853536] [2025-03-08 06:26:02,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511853536] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:26:02,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389831395] [2025-03-08 06:26:02,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:26:02,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:26:02,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:26:02,341 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-08 06:26:02,342 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-08 06:26:02,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 06:26:02,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 06:26:02,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:26:02,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:26:02,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 679 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 06:26:02,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:26:03,290 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-08 06:26:03,290 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:26:04,581 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-08 06:26:04,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389831395] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:26:04,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:26:04,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2025-03-08 06:26:04,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720010363] [2025-03-08 06:26:04,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:26:04,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-08 06:26:04,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:26:04,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-08 06:26:04,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=632, Unknown=0, NotChecked=0, Total=756 [2025-03-08 06:26:04,585 INFO L87 Difference]: Start difference. First operand 78191 states and 107175 transitions. Second operand has 28 states, 28 states have (on average 13.857142857142858) internal successors, (388), 27 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:26:06,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:26:06,277 INFO L93 Difference]: Finished difference Result 320197 states and 438822 transitions. [2025-03-08 06:26:06,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-08 06:26:06,278 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 13.857142857142858) internal successors, (388), 27 states have internal predecessors, (388), 0 states have call successors, (0), 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 150 [2025-03-08 06:26:06,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:26:06,581 INFO L225 Difference]: With dead ends: 320197 [2025-03-08 06:26:06,581 INFO L226 Difference]: Without dead ends: 242131 [2025-03-08 06:26:06,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=557, Invalid=1795, Unknown=0, NotChecked=0, Total=2352 [2025-03-08 06:26:06,617 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 2310 mSDsluCounter, 1121 mSDsCounter, 0 mSdLazyCounter, 1202 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2310 SdHoareTripleChecker+Valid, 1268 SdHoareTripleChecker+Invalid, 1255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:26:06,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2310 Valid, 1268 Invalid, 1255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1202 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:26:06,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242131 states. [2025-03-08 06:26:08,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242131 to 186311. [2025-03-08 06:26:08,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186311 states, 186310 states have (on average 1.366641618807364) internal successors, (254619), 186310 states have internal predecessors, (254619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:26:09,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186311 states to 186311 states and 254619 transitions. [2025-03-08 06:26:09,242 INFO L78 Accepts]: Start accepts. Automaton has 186311 states and 254619 transitions. Word has length 150 [2025-03-08 06:26:09,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:26:09,243 INFO L471 AbstractCegarLoop]: Abstraction has 186311 states and 254619 transitions. [2025-03-08 06:26:09,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 13.857142857142858) internal successors, (388), 27 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:26:09,243 INFO L276 IsEmpty]: Start isEmpty. Operand 186311 states and 254619 transitions. [2025-03-08 06:26:09,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 06:26:09,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:26:09,255 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, 1] [2025-03-08 06:26:09,263 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-08 06:26:09,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-03-08 06:26:09,456 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:26:09,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:26:09,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1998088824, now seen corresponding path program 1 times [2025-03-08 06:26:09,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:26:09,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56607740] [2025-03-08 06:26:09,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:26:09,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:26:09,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 06:26:09,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 06:26:09,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:26:09,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:26:10,576 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:26:10,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:26:10,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56607740] [2025-03-08 06:26:10,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56607740] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:26:10,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973731967] [2025-03-08 06:26:10,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:26:10,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:26:10,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:26:10,587 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-08 06:26:10,592 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-08 06:26:10,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 06:26:10,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 06:26:10,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:26:10,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:26:10,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 06:26:10,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:26:11,696 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 13 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:26:11,697 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:26:12,765 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 13 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:26:12,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973731967] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:26:12,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:26:12,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 34 [2025-03-08 06:26:12,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948794111] [2025-03-08 06:26:12,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:26:12,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-08 06:26:12,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:26:12,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-08 06:26:12,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1073, Unknown=0, NotChecked=0, Total=1190 [2025-03-08 06:26:12,767 INFO L87 Difference]: Start difference. First operand 186311 states and 254619 transitions. Second operand has 35 states, 35 states have (on average 11.771428571428572) internal successors, (412), 34 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:26:29,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:26:29,713 INFO L93 Difference]: Finished difference Result 3125699 states and 4250861 transitions. [2025-03-08 06:26:29,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2025-03-08 06:26:29,714 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 11.771428571428572) internal successors, (412), 34 states have internal predecessors, (412), 0 states have call successors, (0), 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 151 [2025-03-08 06:26:29,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:26:35,084 INFO L225 Difference]: With dead ends: 3125699 [2025-03-08 06:26:35,084 INFO L226 Difference]: Without dead ends: 2939553 [2025-03-08 06:26:35,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18023 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=5835, Invalid=44117, Unknown=0, NotChecked=0, Total=49952 [2025-03-08 06:26:35,407 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 7981 mSDsluCounter, 4021 mSDsCounter, 0 mSdLazyCounter, 5546 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7981 SdHoareTripleChecker+Valid, 4243 SdHoareTripleChecker+Invalid, 5744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 5546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:26:35,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7981 Valid, 4243 Invalid, 5744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 5546 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-08 06:26:37,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2939553 states.