./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 075767edbb592d061c1d85f41edb41733b674c2f33a2c1741ae50b9eba126551 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:39:47,536 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:39:47,591 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:39:47,597 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:39:47,597 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:39:47,617 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:39:47,618 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:39:47,618 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:39:47,618 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:39:47,618 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:39:47,618 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:39:47,618 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:39:47,618 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:39:47,619 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:39:47,619 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:39:47,619 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:39:47,619 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:39:47,620 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:39:47,620 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:39:47,620 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:39:47,620 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:39:47,620 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:39:47,620 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:39:47,620 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:39:47,620 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:39:47,620 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:39:47,620 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:39:47,621 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:39:47,621 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:39:47,621 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:39:47,621 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:39:47,621 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:39:47,621 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:39:47,621 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:39:47,622 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:39:47,622 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:39:47,622 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:39:47,622 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:39:47,622 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:39:47,622 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:39:47,622 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:39:47,622 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:39:47,622 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:39:47,622 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-jdk21/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 -> 075767edbb592d061c1d85f41edb41733b674c2f33a2c1741ae50b9eba126551 [2025-02-05 16:39:47,862 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:39:47,870 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:39:47,872 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:39:47,873 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:39:47,874 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:39:47,875 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2025-02-05 16:39:49,025 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f5659166a/2692aae0be2b41c2b420088b9d3d38f5/FLAG6efdb8345 [2025-02-05 16:39:49,277 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:39:49,278 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2025-02-05 16:39:49,285 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f5659166a/2692aae0be2b41c2b420088b9d3d38f5/FLAG6efdb8345 [2025-02-05 16:39:49,607 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f5659166a/2692aae0be2b41c2b420088b9d3d38f5 [2025-02-05 16:39:49,609 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:39:49,610 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:39:49,611 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:39:49,611 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:39:49,613 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:39:49,614 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:39:49" (1/1) ... [2025-02-05 16:39:49,614 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@556ffe32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:39:49, skipping insertion in model container [2025-02-05 16:39:49,615 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:39:49" (1/1) ... [2025-02-05 16:39:49,635 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:39:49,766 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c[6780,6793] [2025-02-05 16:39:49,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:39:49,800 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:39:49,843 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c[6780,6793] [2025-02-05 16:39:49,870 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:39:49,887 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:39:49,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:39:49 WrapperNode [2025-02-05 16:39:49,888 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:39:49,889 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:39:49,890 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:39:49,890 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:39:49,894 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:39:49" (1/1) ... [2025-02-05 16:39:49,901 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:39:49" (1/1) ... [2025-02-05 16:39:49,920 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 576 [2025-02-05 16:39:49,920 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:39:49,921 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:39:49,921 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:39:49,921 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:39:49,927 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:39:49" (1/1) ... [2025-02-05 16:39:49,928 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:39:49" (1/1) ... [2025-02-05 16:39:49,930 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:39:49" (1/1) ... [2025-02-05 16:39:49,945 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-02-05 16:39:49,946 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:39:49" (1/1) ... [2025-02-05 16:39:49,946 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:39:49" (1/1) ... [2025-02-05 16:39:49,951 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:39:49" (1/1) ... [2025-02-05 16:39:49,952 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:39:49" (1/1) ... [2025-02-05 16:39:49,953 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:39:49" (1/1) ... [2025-02-05 16:39:49,953 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:39:49" (1/1) ... [2025-02-05 16:39:49,955 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:39:49,960 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:39:49,960 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:39:49,960 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:39:49,961 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:39:49" (1/1) ... [2025-02-05 16:39:49,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:39:49,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:39:49,986 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 16:39:49,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 16:39:50,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:39:50,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:39:50,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:39:50,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:39:50,103 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:39:50,104 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:39:50,489 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L501: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-02-05 16:39:50,489 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L456: havoc main_~node4____CPAchecker_TMP_0~1#1;havoc main_~node4__m4~2#1; [2025-02-05 16:39:50,489 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L592: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-02-05 16:39:50,489 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L396: havoc main_~node3__m3~2#1; [2025-02-05 16:39:50,489 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L546: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-02-05 16:39:50,489 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L381: havoc main_~node2__m2~2#1; [2025-02-05 16:39:50,489 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L365: 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_~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_~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-02-05 16:39:50,517 INFO L? ?]: Removed 73 outVars from TransFormulas that were not future-live. [2025-02-05 16:39:50,517 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:39:50,528 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:39:50,528 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:39:50,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:39:50 BoogieIcfgContainer [2025-02-05 16:39:50,529 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:39:50,531 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:39:50,531 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:39:50,534 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:39:50,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:39:49" (1/3) ... [2025-02-05 16:39:50,535 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64f75e5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:39:50, skipping insertion in model container [2025-02-05 16:39:50,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:39:49" (2/3) ... [2025-02-05 16:39:50,535 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64f75e5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:39:50, skipping insertion in model container [2025-02-05 16:39:50,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:39:50" (3/3) ... [2025-02-05 16:39:50,537 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2025-02-05 16:39:50,547 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:39:50,549 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c that has 1 procedures, 123 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-05 16:39:50,594 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:39:50,604 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;@53309f9e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:39:50,604 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:39:50,608 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 121 states have (on average 1.7520661157024793) internal successors, (212), 122 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:50,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-05 16:39:50,613 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:50,614 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:39:50,614 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:39:50,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:50,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1643314481, now seen corresponding path program 1 times [2025-02-05 16:39:50,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:50,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122201538] [2025-02-05 16:39:50,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:50,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:50,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-05 16:39:50,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 16:39:50,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:50,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:51,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:39:51,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:51,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122201538] [2025-02-05 16:39:51,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122201538] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:51,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:51,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:39:51,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438232413] [2025-02-05 16:39:51,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:51,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:39:51,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:51,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:39:51,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:39:51,165 INFO L87 Difference]: Start difference. First operand has 123 states, 121 states have (on average 1.7520661157024793) internal successors, (212), 122 states have internal predecessors, (212), 0 states have call successors, (0), 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 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:51,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:51,411 INFO L93 Difference]: Finished difference Result 589 states and 942 transitions. [2025-02-05 16:39:51,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:39:51,413 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-02-05 16:39:51,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:51,420 INFO L225 Difference]: With dead ends: 589 [2025-02-05 16:39:51,420 INFO L226 Difference]: Without dead ends: 511 [2025-02-05 16:39:51,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:39:51,424 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 820 mSDsluCounter, 1420 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 1911 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:39:51,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 1911 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:39:51,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-02-05 16:39:51,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 185. [2025-02-05 16:39:51,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 1.451086956521739) internal successors, (267), 184 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:51,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 267 transitions. [2025-02-05 16:39:51,479 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 267 transitions. Word has length 62 [2025-02-05 16:39:51,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:51,480 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 267 transitions. [2025-02-05 16:39:51,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:51,480 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 267 transitions. [2025-02-05 16:39:51,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 16:39:51,481 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:51,481 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:39:51,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:39:51,482 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:39:51,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:51,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1243201069, now seen corresponding path program 1 times [2025-02-05 16:39:51,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:51,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392319114] [2025-02-05 16:39:51,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:51,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:51,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 16:39:51,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 16:39:51,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:51,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:51,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:39:51,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:51,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392319114] [2025-02-05 16:39:51,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392319114] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:51,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:51,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:39:51,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700157820] [2025-02-05 16:39:51,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:51,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:39:51,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:51,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:39:51,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:39:51,709 INFO L87 Difference]: Start difference. First operand 185 states and 267 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:51,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:51,812 INFO L93 Difference]: Finished difference Result 654 states and 1000 transitions. [2025-02-05 16:39:51,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:39:51,812 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-02-05 16:39:51,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:51,814 INFO L225 Difference]: With dead ends: 654 [2025-02-05 16:39:51,815 INFO L226 Difference]: Without dead ends: 554 [2025-02-05 16:39:51,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:39:51,816 INFO L435 NwaCegarLoop]: 464 mSDtfsCounter, 521 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:39:51,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 1119 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:39:51,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-02-05 16:39:51,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 294. [2025-02-05 16:39:51,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 293 states have (on average 1.4982935153583619) internal successors, (439), 293 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:51,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 439 transitions. [2025-02-05 16:39:51,827 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 439 transitions. Word has length 64 [2025-02-05 16:39:51,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:51,828 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 439 transitions. [2025-02-05 16:39:51,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:51,828 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 439 transitions. [2025-02-05 16:39:51,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 16:39:51,829 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:51,829 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:39:51,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:39:51,829 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:39:51,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:51,830 INFO L85 PathProgramCache]: Analyzing trace with hash 835851211, now seen corresponding path program 1 times [2025-02-05 16:39:51,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:51,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107546051] [2025-02-05 16:39:51,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:51,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:51,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 16:39:51,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 16:39:51,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:51,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:51,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:39:51,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:51,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107546051] [2025-02-05 16:39:51,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107546051] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:51,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:51,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:39:51,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147980103] [2025-02-05 16:39:51,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:51,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:39:51,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:51,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:39:51,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:39:51,997 INFO L87 Difference]: Start difference. First operand 294 states and 439 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:52,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:52,096 INFO L93 Difference]: Finished difference Result 763 states and 1172 transitions. [2025-02-05 16:39:52,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:39:52,096 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-02-05 16:39:52,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:52,098 INFO L225 Difference]: With dead ends: 763 [2025-02-05 16:39:52,098 INFO L226 Difference]: Without dead ends: 663 [2025-02-05 16:39:52,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:39:52,100 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 514 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:39:52,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 929 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:39:52,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2025-02-05 16:39:52,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 452. [2025-02-05 16:39:52,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 451 states have (on average 1.5254988913525498) internal successors, (688), 451 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:52,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 688 transitions. [2025-02-05 16:39:52,126 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 688 transitions. Word has length 64 [2025-02-05 16:39:52,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:52,126 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 688 transitions. [2025-02-05 16:39:52,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:52,126 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 688 transitions. [2025-02-05 16:39:52,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 16:39:52,129 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:52,130 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:39:52,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:39:52,130 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:39:52,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:52,130 INFO L85 PathProgramCache]: Analyzing trace with hash 2138064083, now seen corresponding path program 1 times [2025-02-05 16:39:52,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:52,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319460426] [2025-02-05 16:39:52,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:52,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:52,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 16:39:52,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 16:39:52,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:52,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:52,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:39:52,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:52,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319460426] [2025-02-05 16:39:52,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319460426] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:52,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:52,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:39:52,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979802246] [2025-02-05 16:39:52,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:52,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:39:52,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:52,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:39:52,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:39:52,306 INFO L87 Difference]: Start difference. First operand 452 states and 688 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:52,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:52,406 INFO L93 Difference]: Finished difference Result 867 states and 1336 transitions. [2025-02-05 16:39:52,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:39:52,407 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-02-05 16:39:52,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:52,410 INFO L225 Difference]: With dead ends: 867 [2025-02-05 16:39:52,410 INFO L226 Difference]: Without dead ends: 767 [2025-02-05 16:39:52,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:39:52,413 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 587 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:39:52,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 865 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:39:52,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2025-02-05 16:39:52,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 556. [2025-02-05 16:39:52,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 555 states have (on average 1.5351351351351352) internal successors, (852), 555 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:52,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 852 transitions. [2025-02-05 16:39:52,424 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 852 transitions. Word has length 64 [2025-02-05 16:39:52,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:52,424 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 852 transitions. [2025-02-05 16:39:52,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:52,424 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 852 transitions. [2025-02-05 16:39:52,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 16:39:52,425 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:52,425 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:39:52,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:39:52,426 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:39:52,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:52,426 INFO L85 PathProgramCache]: Analyzing trace with hash 88010955, now seen corresponding path program 1 times [2025-02-05 16:39:52,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:52,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406752811] [2025-02-05 16:39:52,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:52,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:52,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 16:39:52,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 16:39:52,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:52,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:52,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:39:52,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:52,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406752811] [2025-02-05 16:39:52,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406752811] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:52,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:52,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:39:52,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687055374] [2025-02-05 16:39:52,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:52,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:39:52,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:52,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:39:52,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:39:52,572 INFO L87 Difference]: Start difference. First operand 556 states and 852 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:52,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:52,683 INFO L93 Difference]: Finished difference Result 966 states and 1492 transitions. [2025-02-05 16:39:52,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:39:52,683 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-02-05 16:39:52,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:52,687 INFO L225 Difference]: With dead ends: 966 [2025-02-05 16:39:52,688 INFO L226 Difference]: Without dead ends: 866 [2025-02-05 16:39:52,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:39:52,690 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 657 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:39:52,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 928 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:39:52,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2025-02-05 16:39:52,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 655. [2025-02-05 16:39:52,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 654 states have (on average 1.5412844036697249) internal successors, (1008), 654 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:52,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1008 transitions. [2025-02-05 16:39:52,704 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1008 transitions. Word has length 64 [2025-02-05 16:39:52,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:52,705 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 1008 transitions. [2025-02-05 16:39:52,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:52,705 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1008 transitions. [2025-02-05 16:39:52,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 16:39:52,706 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:52,706 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:39:52,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:39:52,706 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:39:52,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:52,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1361733080, now seen corresponding path program 1 times [2025-02-05 16:39:52,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:52,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888793568] [2025-02-05 16:39:52,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:52,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:52,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 16:39:52,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 16:39:52,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:52,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:52,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:39:52,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:52,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888793568] [2025-02-05 16:39:52,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888793568] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:52,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:52,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:39:52,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089665933] [2025-02-05 16:39:52,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:52,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:39:52,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:52,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:39:52,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:39:52,752 INFO L87 Difference]: Start difference. First operand 655 states and 1008 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:52,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:52,778 INFO L93 Difference]: Finished difference Result 1666 states and 2591 transitions. [2025-02-05 16:39:52,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:39:52,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-02-05 16:39:52,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:52,782 INFO L225 Difference]: With dead ends: 1666 [2025-02-05 16:39:52,782 INFO L226 Difference]: Without dead ends: 1125 [2025-02-05 16:39:52,782 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-02-05 16:39:52,783 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 67 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 380 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-02-05 16:39:52,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 380 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:39:52,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2025-02-05 16:39:52,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 1123. [2025-02-05 16:39:52,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1123 states, 1122 states have (on average 1.5276292335115864) internal successors, (1714), 1122 states have internal predecessors, (1714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:52,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1714 transitions. [2025-02-05 16:39:52,802 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1714 transitions. Word has length 64 [2025-02-05 16:39:52,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:52,802 INFO L471 AbstractCegarLoop]: Abstraction has 1123 states and 1714 transitions. [2025-02-05 16:39:52,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:52,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1714 transitions. [2025-02-05 16:39:52,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 16:39:52,803 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:52,803 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:39:52,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:39:52,803 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:39:52,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:52,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1362894929, now seen corresponding path program 1 times [2025-02-05 16:39:52,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:52,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915426156] [2025-02-05 16:39:52,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:52,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:52,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 16:39:52,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 16:39:52,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:52,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:53,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:39:53,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:53,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915426156] [2025-02-05 16:39:53,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915426156] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:53,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:53,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:39:53,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707456317] [2025-02-05 16:39:53,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:53,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:39:53,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:53,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:39:53,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:39:53,035 INFO L87 Difference]: Start difference. First operand 1123 states and 1714 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:53,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:53,139 INFO L93 Difference]: Finished difference Result 2134 states and 3275 transitions. [2025-02-05 16:39:53,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:39:53,140 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-02-05 16:39:53,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:53,143 INFO L225 Difference]: With dead ends: 2134 [2025-02-05 16:39:53,143 INFO L226 Difference]: Without dead ends: 1125 [2025-02-05 16:39:53,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:39:53,145 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 106 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:39:53,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 547 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:39:53,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2025-02-05 16:39:53,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 1123. [2025-02-05 16:39:53,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1123 states, 1122 states have (on average 1.5222816399286987) internal successors, (1708), 1122 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:53,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1708 transitions. [2025-02-05 16:39:53,172 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1708 transitions. Word has length 64 [2025-02-05 16:39:53,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:53,172 INFO L471 AbstractCegarLoop]: Abstraction has 1123 states and 1708 transitions. [2025-02-05 16:39:53,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:53,172 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1708 transitions. [2025-02-05 16:39:53,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 16:39:53,173 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:53,173 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] [2025-02-05 16:39:53,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:39:53,173 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:39:53,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:53,174 INFO L85 PathProgramCache]: Analyzing trace with hash -731175710, now seen corresponding path program 1 times [2025-02-05 16:39:53,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:53,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964799670] [2025-02-05 16:39:53,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:53,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:53,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 16:39:53,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 16:39:53,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:53,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:53,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:39:53,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:53,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964799670] [2025-02-05 16:39:53,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964799670] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:53,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:53,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:39:53,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927248205] [2025-02-05 16:39:53,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:53,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:39:53,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:53,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:39:53,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:39:53,281 INFO L87 Difference]: Start difference. First operand 1123 states and 1708 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:53,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:53,436 INFO L93 Difference]: Finished difference Result 3265 states and 5000 transitions. [2025-02-05 16:39:53,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:39:53,437 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2025-02-05 16:39:53,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:53,443 INFO L225 Difference]: With dead ends: 3265 [2025-02-05 16:39:53,444 INFO L226 Difference]: Without dead ends: 2172 [2025-02-05 16:39:53,446 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-02-05 16:39:53,448 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 659 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:39:53,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 144 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:39:53,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2172 states. [2025-02-05 16:39:53,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2172 to 2170. [2025-02-05 16:39:53,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2170 states, 2169 states have (on average 1.5209774089442138) internal successors, (3299), 2169 states have internal predecessors, (3299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:53,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 3299 transitions. [2025-02-05 16:39:53,500 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 3299 transitions. Word has length 65 [2025-02-05 16:39:53,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:53,501 INFO L471 AbstractCegarLoop]: Abstraction has 2170 states and 3299 transitions. [2025-02-05 16:39:53,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:53,501 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 3299 transitions. [2025-02-05 16:39:53,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 16:39:53,502 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:53,502 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] [2025-02-05 16:39:53,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:39:53,502 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:39:53,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:53,503 INFO L85 PathProgramCache]: Analyzing trace with hash 505063271, now seen corresponding path program 1 times [2025-02-05 16:39:53,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:53,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113758332] [2025-02-05 16:39:53,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:53,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:53,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 16:39:53,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 16:39:53,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:53,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:53,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:39:53,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:53,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113758332] [2025-02-05 16:39:53,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113758332] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:53,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:53,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:39:53,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804287952] [2025-02-05 16:39:53,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:53,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:39:53,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:53,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:39:53,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:39:53,609 INFO L87 Difference]: Start difference. First operand 2170 states and 3299 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:53,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:53,725 INFO L93 Difference]: Finished difference Result 4298 states and 6553 transitions. [2025-02-05 16:39:53,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:39:53,725 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2025-02-05 16:39:53,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:53,733 INFO L225 Difference]: With dead ends: 4298 [2025-02-05 16:39:53,733 INFO L226 Difference]: Without dead ends: 2170 [2025-02-05 16:39:53,736 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-02-05 16:39:53,737 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 414 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:39:53,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 113 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:39:53,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2170 states. [2025-02-05 16:39:53,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2170 to 2170. [2025-02-05 16:39:53,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2170 states, 2169 states have (on average 1.500230520977409) internal successors, (3254), 2169 states have internal predecessors, (3254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:53,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 3254 transitions. [2025-02-05 16:39:53,788 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 3254 transitions. Word has length 66 [2025-02-05 16:39:53,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:53,788 INFO L471 AbstractCegarLoop]: Abstraction has 2170 states and 3254 transitions. [2025-02-05 16:39:53,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:53,789 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 3254 transitions. [2025-02-05 16:39:53,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 16:39:53,789 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:53,789 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] [2025-02-05 16:39:53,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:39:53,790 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:39:53,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:53,790 INFO L85 PathProgramCache]: Analyzing trace with hash 850403878, now seen corresponding path program 1 times [2025-02-05 16:39:53,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:53,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554222492] [2025-02-05 16:39:53,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:53,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:53,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 16:39:53,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 16:39:53,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:53,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:53,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:39:53,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:53,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554222492] [2025-02-05 16:39:53,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554222492] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:53,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:53,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:39:53,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355720559] [2025-02-05 16:39:53,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:53,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:39:53,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:53,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:39:53,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:39:53,906 INFO L87 Difference]: Start difference. First operand 2170 states and 3254 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:53,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:53,998 INFO L93 Difference]: Finished difference Result 4306 states and 6473 transitions. [2025-02-05 16:39:53,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:39:53,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2025-02-05 16:39:53,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:54,004 INFO L225 Difference]: With dead ends: 4306 [2025-02-05 16:39:54,004 INFO L226 Difference]: Without dead ends: 2170 [2025-02-05 16:39:54,007 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-02-05 16:39:54,007 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 430 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:39:54,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 97 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:39:54,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2170 states. [2025-02-05 16:39:54,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2170 to 2170. [2025-02-05 16:39:54,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2170 states, 2169 states have (on average 1.479483633010604) internal successors, (3209), 2169 states have internal predecessors, (3209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:54,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 3209 transitions. [2025-02-05 16:39:54,043 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 3209 transitions. Word has length 67 [2025-02-05 16:39:54,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:54,043 INFO L471 AbstractCegarLoop]: Abstraction has 2170 states and 3209 transitions. [2025-02-05 16:39:54,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:54,044 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 3209 transitions. [2025-02-05 16:39:54,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 16:39:54,044 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:54,044 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] [2025-02-05 16:39:54,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:39:54,045 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:39:54,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:54,045 INFO L85 PathProgramCache]: Analyzing trace with hash -117150521, now seen corresponding path program 1 times [2025-02-05 16:39:54,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:54,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087412527] [2025-02-05 16:39:54,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:54,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:54,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 16:39:54,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 16:39:54,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:54,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:54,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:39:54,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:54,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087412527] [2025-02-05 16:39:54,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087412527] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:54,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:54,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:39:54,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067547284] [2025-02-05 16:39:54,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:54,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:39:54,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:54,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:39:54,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:39:54,112 INFO L87 Difference]: Start difference. First operand 2170 states and 3209 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:54,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:54,203 INFO L93 Difference]: Finished difference Result 4302 states and 6379 transitions. [2025-02-05 16:39:54,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:39:54,204 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2025-02-05 16:39:54,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:54,209 INFO L225 Difference]: With dead ends: 4302 [2025-02-05 16:39:54,209 INFO L226 Difference]: Without dead ends: 2170 [2025-02-05 16:39:54,211 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-02-05 16:39:54,212 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 412 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:39:54,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 105 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:39:54,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2170 states. [2025-02-05 16:39:54,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2170 to 2170. [2025-02-05 16:39:54,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2170 states, 2169 states have (on average 1.458736745043799) internal successors, (3164), 2169 states have internal predecessors, (3164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:54,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 3164 transitions. [2025-02-05 16:39:54,247 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 3164 transitions. Word has length 68 [2025-02-05 16:39:54,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:54,247 INFO L471 AbstractCegarLoop]: Abstraction has 2170 states and 3164 transitions. [2025-02-05 16:39:54,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:54,247 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 3164 transitions. [2025-02-05 16:39:54,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 16:39:54,248 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:54,248 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:39:54,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:39:54,248 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:39:54,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:54,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1955496342, now seen corresponding path program 1 times [2025-02-05 16:39:54,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:54,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752224793] [2025-02-05 16:39:54,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:54,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:54,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 16:39:54,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 16:39:54,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:54,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:54,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:39:54,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:54,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752224793] [2025-02-05 16:39:54,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752224793] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:54,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:54,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:39:54,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371787396] [2025-02-05 16:39:54,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:54,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:39:54,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:54,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:39:54,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:39:54,356 INFO L87 Difference]: Start difference. First operand 2170 states and 3164 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:54,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:54,387 INFO L93 Difference]: Finished difference Result 5059 states and 7400 transitions. [2025-02-05 16:39:54,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:39:54,388 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-02-05 16:39:54,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:54,396 INFO L225 Difference]: With dead ends: 5059 [2025-02-05 16:39:54,396 INFO L226 Difference]: Without dead ends: 3043 [2025-02-05 16:39:54,398 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-02-05 16:39:54,399 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 83 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 364 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-02-05 16:39:54,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 364 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:39:54,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3043 states. [2025-02-05 16:39:54,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3043 to 3041. [2025-02-05 16:39:54,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3041 states, 3040 states have (on average 1.4523026315789473) internal successors, (4415), 3040 states have internal predecessors, (4415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:54,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3041 states to 3041 states and 4415 transitions. [2025-02-05 16:39:54,450 INFO L78 Accepts]: Start accepts. Automaton has 3041 states and 4415 transitions. Word has length 69 [2025-02-05 16:39:54,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:54,450 INFO L471 AbstractCegarLoop]: Abstraction has 3041 states and 4415 transitions. [2025-02-05 16:39:54,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:54,450 INFO L276 IsEmpty]: Start isEmpty. Operand 3041 states and 4415 transitions. [2025-02-05 16:39:54,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 16:39:54,450 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:54,451 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:39:54,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:39:54,451 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:39:54,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:54,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1923292271, now seen corresponding path program 1 times [2025-02-05 16:39:54,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:54,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39054206] [2025-02-05 16:39:54,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:54,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:54,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 16:39:54,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 16:39:54,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:54,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:54,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:39:54,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:54,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39054206] [2025-02-05 16:39:54,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39054206] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:54,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:54,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:39:54,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735881938] [2025-02-05 16:39:54,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:54,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:39:54,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:54,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:39:54,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:39:54,650 INFO L87 Difference]: Start difference. First operand 3041 states and 4415 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:54,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:54,677 INFO L93 Difference]: Finished difference Result 3063 states and 4446 transitions. [2025-02-05 16:39:54,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:39:54,677 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-02-05 16:39:54,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:54,685 INFO L225 Difference]: With dead ends: 3063 [2025-02-05 16:39:54,685 INFO L226 Difference]: Without dead ends: 3061 [2025-02-05 16:39:54,686 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-02-05 16:39:54,687 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 605 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-02-05 16:39:54,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 605 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:39:54,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3061 states. [2025-02-05 16:39:54,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3061 to 3061. [2025-02-05 16:39:54,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3061 states, 3060 states have (on average 1.441830065359477) internal successors, (4412), 3060 states have internal predecessors, (4412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:54,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3061 states to 3061 states and 4412 transitions. [2025-02-05 16:39:54,733 INFO L78 Accepts]: Start accepts. Automaton has 3061 states and 4412 transitions. Word has length 69 [2025-02-05 16:39:54,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:54,733 INFO L471 AbstractCegarLoop]: Abstraction has 3061 states and 4412 transitions. [2025-02-05 16:39:54,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:54,734 INFO L276 IsEmpty]: Start isEmpty. Operand 3061 states and 4412 transitions. [2025-02-05 16:39:54,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-05 16:39:54,735 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:54,735 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] [2025-02-05 16:39:54,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:39:54,735 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:39:54,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:54,736 INFO L85 PathProgramCache]: Analyzing trace with hash -501450425, now seen corresponding path program 1 times [2025-02-05 16:39:54,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:54,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504317628] [2025-02-05 16:39:54,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:54,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:54,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 16:39:54,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 16:39:54,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:54,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:55,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:39:55,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:55,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504317628] [2025-02-05 16:39:55,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504317628] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:55,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:55,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:39:55,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311365379] [2025-02-05 16:39:55,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:55,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:39:55,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:55,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:39:55,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:39:55,020 INFO L87 Difference]: Start difference. First operand 3061 states and 4412 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:55,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:55,425 INFO L93 Difference]: Finished difference Result 9096 states and 13080 transitions. [2025-02-05 16:39:55,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:39:55,426 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2025-02-05 16:39:55,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:55,448 INFO L225 Difference]: With dead ends: 9096 [2025-02-05 16:39:55,451 INFO L226 Difference]: Without dead ends: 6150 [2025-02-05 16:39:55,455 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-02-05 16:39:55,456 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 915 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 915 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:39:55,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [915 Valid, 400 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:39:55,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6150 states. [2025-02-05 16:39:55,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6150 to 3061. [2025-02-05 16:39:55,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3061 states, 3060 states have (on average 1.4398692810457516) internal successors, (4406), 3060 states have internal predecessors, (4406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:55,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3061 states to 3061 states and 4406 transitions. [2025-02-05 16:39:55,528 INFO L78 Accepts]: Start accepts. Automaton has 3061 states and 4406 transitions. Word has length 70 [2025-02-05 16:39:55,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:55,528 INFO L471 AbstractCegarLoop]: Abstraction has 3061 states and 4406 transitions. [2025-02-05 16:39:55,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:55,528 INFO L276 IsEmpty]: Start isEmpty. Operand 3061 states and 4406 transitions. [2025-02-05 16:39:55,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-05 16:39:55,529 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:55,529 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] [2025-02-05 16:39:55,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:39:55,529 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:39:55,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:55,529 INFO L85 PathProgramCache]: Analyzing trace with hash 800762447, now seen corresponding path program 1 times [2025-02-05 16:39:55,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:55,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690313284] [2025-02-05 16:39:55,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:55,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:55,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 16:39:55,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 16:39:55,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:55,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:55,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:39:55,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:55,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690313284] [2025-02-05 16:39:55,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690313284] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:55,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:55,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:39:55,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549651206] [2025-02-05 16:39:55,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:55,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:39:55,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:55,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:39:55,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:39:55,758 INFO L87 Difference]: Start difference. First operand 3061 states and 4406 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:56,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:56,124 INFO L93 Difference]: Finished difference Result 7599 states and 10894 transitions. [2025-02-05 16:39:56,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:39:56,125 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2025-02-05 16:39:56,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:56,135 INFO L225 Difference]: With dead ends: 7599 [2025-02-05 16:39:56,136 INFO L226 Difference]: Without dead ends: 4638 [2025-02-05 16:39:56,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-02-05 16:39:56,141 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 430 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:39:56,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 399 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:39:56,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4638 states. [2025-02-05 16:39:56,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4638 to 3061. [2025-02-05 16:39:56,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3061 states, 3060 states have (on average 1.4388888888888889) internal successors, (4403), 3060 states have internal predecessors, (4403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:56,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3061 states to 3061 states and 4403 transitions. [2025-02-05 16:39:56,223 INFO L78 Accepts]: Start accepts. Automaton has 3061 states and 4403 transitions. Word has length 70 [2025-02-05 16:39:56,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:56,223 INFO L471 AbstractCegarLoop]: Abstraction has 3061 states and 4403 transitions. [2025-02-05 16:39:56,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:56,223 INFO L276 IsEmpty]: Start isEmpty. Operand 3061 states and 4403 transitions. [2025-02-05 16:39:56,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-05 16:39:56,224 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:56,224 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] [2025-02-05 16:39:56,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:39:56,224 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:39:56,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:56,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1610210887, now seen corresponding path program 1 times [2025-02-05 16:39:56,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:56,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972060955] [2025-02-05 16:39:56,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:56,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:56,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 16:39:56,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 16:39:56,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:56,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:56,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:39:56,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:56,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972060955] [2025-02-05 16:39:56,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972060955] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:56,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:56,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 16:39:56,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001750121] [2025-02-05 16:39:56,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:56,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:39:56,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:56,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:39:56,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:39:56,623 INFO L87 Difference]: Start difference. First operand 3061 states and 4403 transitions. Second operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:57,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:57,063 INFO L93 Difference]: Finished difference Result 9051 states and 12999 transitions. [2025-02-05 16:39:57,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 16:39:57,064 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2025-02-05 16:39:57,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:57,073 INFO L225 Difference]: With dead ends: 9051 [2025-02-05 16:39:57,073 INFO L226 Difference]: Without dead ends: 6135 [2025-02-05 16:39:57,077 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-02-05 16:39:57,078 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 542 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:39:57,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 484 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:39:57,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6135 states. [2025-02-05 16:39:57,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6135 to 3061. [2025-02-05 16:39:57,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3061 states, 3060 states have (on average 1.4359477124183007) internal successors, (4394), 3060 states have internal predecessors, (4394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:57,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3061 states to 3061 states and 4394 transitions. [2025-02-05 16:39:57,129 INFO L78 Accepts]: Start accepts. Automaton has 3061 states and 4394 transitions. Word has length 70 [2025-02-05 16:39:57,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:57,129 INFO L471 AbstractCegarLoop]: Abstraction has 3061 states and 4394 transitions. [2025-02-05 16:39:57,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:57,130 INFO L276 IsEmpty]: Start isEmpty. Operand 3061 states and 4394 transitions. [2025-02-05 16:39:57,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-05 16:39:57,130 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:57,130 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] [2025-02-05 16:39:57,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:39:57,131 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:39:57,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:57,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1848412585, now seen corresponding path program 1 times [2025-02-05 16:39:57,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:57,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501023616] [2025-02-05 16:39:57,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:57,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:57,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-05 16:39:57,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-05 16:39:57,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:57,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:57,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-02-05 16:39:57,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:57,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501023616] [2025-02-05 16:39:57,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501023616] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:57,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:57,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 16:39:57,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818223542] [2025-02-05 16:39:57,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:57,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 16:39:57,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:57,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 16:39:57,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:39:57,528 INFO L87 Difference]: Start difference. First operand 3061 states and 4394 transitions. Second operand has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:57,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:57,973 INFO L93 Difference]: Finished difference Result 8573 states and 12301 transitions. [2025-02-05 16:39:57,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:39:57,973 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2025-02-05 16:39:57,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:57,981 INFO L225 Difference]: With dead ends: 8573 [2025-02-05 16:39:57,981 INFO L226 Difference]: Without dead ends: 6140 [2025-02-05 16:39:57,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=292, Unknown=0, NotChecked=0, Total=420 [2025-02-05 16:39:57,985 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 700 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:39:57,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 710 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:39:57,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6140 states. [2025-02-05 16:39:58,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6140 to 3096. [2025-02-05 16:39:58,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3096 states, 3095 states have (on average 1.432956381260097) internal successors, (4435), 3095 states have internal predecessors, (4435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:58,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3096 states to 3096 states and 4435 transitions. [2025-02-05 16:39:58,025 INFO L78 Accepts]: Start accepts. Automaton has 3096 states and 4435 transitions. Word has length 71 [2025-02-05 16:39:58,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:58,025 INFO L471 AbstractCegarLoop]: Abstraction has 3096 states and 4435 transitions. [2025-02-05 16:39:58,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:58,026 INFO L276 IsEmpty]: Start isEmpty. Operand 3096 states and 4435 transitions. [2025-02-05 16:39:58,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-05 16:39:58,026 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:58,026 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:39:58,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 16:39:58,026 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:39:58,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:58,027 INFO L85 PathProgramCache]: Analyzing trace with hash 482342239, now seen corresponding path program 1 times [2025-02-05 16:39:58,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:58,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737373300] [2025-02-05 16:39:58,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:58,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:58,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-05 16:39:58,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-05 16:39:58,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:58,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:59,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:39:59,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:59,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737373300] [2025-02-05 16:39:59,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737373300] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:59,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:59,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2025-02-05 16:39:59,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688474837] [2025-02-05 16:39:59,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:59,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-05 16:39:59,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:59,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-05 16:39:59,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=645, Unknown=0, NotChecked=0, Total=702 [2025-02-05 16:39:59,064 INFO L87 Difference]: Start difference. First operand 3096 states and 4435 transitions. Second operand has 27 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 27 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:01,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:01,348 INFO L93 Difference]: Finished difference Result 9998 states and 14327 transitions. [2025-02-05 16:40:01,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-05 16:40:01,350 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 27 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-02-05 16:40:01,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:01,361 INFO L225 Difference]: With dead ends: 9998 [2025-02-05 16:40:01,362 INFO L226 Difference]: Without dead ends: 9080 [2025-02-05 16:40:01,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=365, Invalid=2085, Unknown=0, NotChecked=0, Total=2450 [2025-02-05 16:40:01,364 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 1254 mSDsluCounter, 3731 mSDsCounter, 0 mSdLazyCounter, 2883 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1254 SdHoareTripleChecker+Valid, 3979 SdHoareTripleChecker+Invalid, 2895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:01,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1254 Valid, 3979 Invalid, 2895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2883 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 16:40:01,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9080 states. [2025-02-05 16:40:01,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9080 to 3101. [2025-02-05 16:40:01,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3101 states, 3100 states have (on average 1.4329032258064516) internal successors, (4442), 3100 states have internal predecessors, (4442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:01,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3101 states to 3101 states and 4442 transitions. [2025-02-05 16:40:01,443 INFO L78 Accepts]: Start accepts. Automaton has 3101 states and 4442 transitions. Word has length 72 [2025-02-05 16:40:01,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:01,443 INFO L471 AbstractCegarLoop]: Abstraction has 3101 states and 4442 transitions. [2025-02-05 16:40:01,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 27 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:01,444 INFO L276 IsEmpty]: Start isEmpty. Operand 3101 states and 4442 transitions. [2025-02-05 16:40:01,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-05 16:40:01,444 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:01,445 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:01,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 16:40:01,445 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:40:01,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:01,445 INFO L85 PathProgramCache]: Analyzing trace with hash -671802233, now seen corresponding path program 1 times [2025-02-05 16:40:01,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:01,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44376847] [2025-02-05 16:40:01,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:01,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:01,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-05 16:40:01,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-05 16:40:01,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:01,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:01,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:01,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:01,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44376847] [2025-02-05 16:40:01,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44376847] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:01,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:01,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 16:40:01,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969766690] [2025-02-05 16:40:01,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:01,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:40:01,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:01,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:40:01,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:40:01,910 INFO L87 Difference]: Start difference. First operand 3101 states and 4442 transitions. Second operand has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:02,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:02,372 INFO L93 Difference]: Finished difference Result 5617 states and 8062 transitions. [2025-02-05 16:40:02,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 16:40:02,373 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-02-05 16:40:02,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:02,378 INFO L225 Difference]: With dead ends: 5617 [2025-02-05 16:40:02,379 INFO L226 Difference]: Without dead ends: 4473 [2025-02-05 16:40:02,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-02-05 16:40:02,381 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 749 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:02,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [749 Valid, 878 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:40:02,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4473 states. [2025-02-05 16:40:02,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4473 to 3054. [2025-02-05 16:40:02,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3054 states, 3053 states have (on average 1.433671798231248) internal successors, (4377), 3053 states have internal predecessors, (4377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:02,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3054 states to 3054 states and 4377 transitions. [2025-02-05 16:40:02,412 INFO L78 Accepts]: Start accepts. Automaton has 3054 states and 4377 transitions. Word has length 72 [2025-02-05 16:40:02,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:02,412 INFO L471 AbstractCegarLoop]: Abstraction has 3054 states and 4377 transitions. [2025-02-05 16:40:02,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:02,412 INFO L276 IsEmpty]: Start isEmpty. Operand 3054 states and 4377 transitions. [2025-02-05 16:40:02,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-05 16:40:02,413 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:02,413 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:02,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 16:40:02,413 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:40:02,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:02,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1331720313, now seen corresponding path program 1 times [2025-02-05 16:40:02,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:02,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256921885] [2025-02-05 16:40:02,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:02,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:02,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-05 16:40:02,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-05 16:40:02,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:02,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:02,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:02,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:02,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256921885] [2025-02-05 16:40:02,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256921885] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:02,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:02,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 16:40:02,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575714439] [2025-02-05 16:40:02,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:02,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:40:02,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:02,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:40:02,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:40:02,850 INFO L87 Difference]: Start difference. First operand 3054 states and 4377 transitions. Second operand has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:03,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:03,335 INFO L93 Difference]: Finished difference Result 7093 states and 10211 transitions. [2025-02-05 16:40:03,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 16:40:03,336 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-02-05 16:40:03,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:03,343 INFO L225 Difference]: With dead ends: 7093 [2025-02-05 16:40:03,343 INFO L226 Difference]: Without dead ends: 5979 [2025-02-05 16:40:03,345 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-02-05 16:40:03,345 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 678 mSDsluCounter, 1122 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 1322 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:03,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 1322 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:40:03,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5979 states. [2025-02-05 16:40:03,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5979 to 3026. [2025-02-05 16:40:03,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3026 states, 3025 states have (on average 1.4337190082644629) internal successors, (4337), 3025 states have internal predecessors, (4337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:03,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3026 states to 3026 states and 4337 transitions. [2025-02-05 16:40:03,386 INFO L78 Accepts]: Start accepts. Automaton has 3026 states and 4337 transitions. Word has length 72 [2025-02-05 16:40:03,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:03,386 INFO L471 AbstractCegarLoop]: Abstraction has 3026 states and 4337 transitions. [2025-02-05 16:40:03,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:03,386 INFO L276 IsEmpty]: Start isEmpty. Operand 3026 states and 4337 transitions. [2025-02-05 16:40:03,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-05 16:40:03,388 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:03,388 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:03,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 16:40:03,388 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:40:03,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:03,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1809102511, now seen corresponding path program 1 times [2025-02-05 16:40:03,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:03,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041959001] [2025-02-05 16:40:03,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:03,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:03,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-05 16:40:03,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-05 16:40:03,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:03,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:03,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:03,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:03,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041959001] [2025-02-05 16:40:03,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041959001] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:03,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:03,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 16:40:03,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358156721] [2025-02-05 16:40:03,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:03,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:40:03,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:03,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:40:03,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:40:03,780 INFO L87 Difference]: Start difference. First operand 3026 states and 4337 transitions. Second operand has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:04,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:04,240 INFO L93 Difference]: Finished difference Result 7046 states and 10146 transitions. [2025-02-05 16:40:04,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 16:40:04,241 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-02-05 16:40:04,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:04,247 INFO L225 Difference]: With dead ends: 7046 [2025-02-05 16:40:04,247 INFO L226 Difference]: Without dead ends: 5953 [2025-02-05 16:40:04,249 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-02-05 16:40:04,250 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 650 mSDsluCounter, 1233 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 1425 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:04,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [650 Valid, 1425 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:40:04,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5953 states. [2025-02-05 16:40:04,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5953 to 3022. [2025-02-05 16:40:04,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3022 states, 3021 states have (on average 1.433300231711354) internal successors, (4330), 3021 states have internal predecessors, (4330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:04,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3022 states to 3022 states and 4330 transitions. [2025-02-05 16:40:04,286 INFO L78 Accepts]: Start accepts. Automaton has 3022 states and 4330 transitions. Word has length 72 [2025-02-05 16:40:04,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:04,287 INFO L471 AbstractCegarLoop]: Abstraction has 3022 states and 4330 transitions. [2025-02-05 16:40:04,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:04,287 INFO L276 IsEmpty]: Start isEmpty. Operand 3022 states and 4330 transitions. [2025-02-05 16:40:04,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-05 16:40:04,287 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:04,287 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:04,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 16:40:04,288 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:40:04,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:04,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1184858689, now seen corresponding path program 1 times [2025-02-05 16:40:04,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:04,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8995899] [2025-02-05 16:40:04,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:04,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:04,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-05 16:40:04,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-05 16:40:04,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:04,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:04,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:04,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:04,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8995899] [2025-02-05 16:40:04,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8995899] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:04,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:04,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 16:40:04,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562108745] [2025-02-05 16:40:04,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:04,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 16:40:04,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:04,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 16:40:04,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:40:04,619 INFO L87 Difference]: Start difference. First operand 3022 states and 4330 transitions. Second operand has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:04,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:04,985 INFO L93 Difference]: Finished difference Result 9497 states and 13665 transitions. [2025-02-05 16:40:04,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:40:04,988 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-02-05 16:40:04,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:04,998 INFO L225 Difference]: With dead ends: 9497 [2025-02-05 16:40:04,998 INFO L226 Difference]: Without dead ends: 8565 [2025-02-05 16:40:05,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2025-02-05 16:40:05,003 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 647 mSDsluCounter, 1135 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 647 SdHoareTripleChecker+Valid, 1322 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:05,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [647 Valid, 1322 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:40:05,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8565 states. [2025-02-05 16:40:05,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8565 to 2919. [2025-02-05 16:40:05,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2919 states, 2918 states have (on average 1.4348869088416725) internal successors, (4187), 2918 states have internal predecessors, (4187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:05,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2919 states to 2919 states and 4187 transitions. [2025-02-05 16:40:05,052 INFO L78 Accepts]: Start accepts. Automaton has 2919 states and 4187 transitions. Word has length 73 [2025-02-05 16:40:05,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:05,052 INFO L471 AbstractCegarLoop]: Abstraction has 2919 states and 4187 transitions. [2025-02-05 16:40:05,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:05,053 INFO L276 IsEmpty]: Start isEmpty. Operand 2919 states and 4187 transitions. [2025-02-05 16:40:05,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 16:40:05,054 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:05,054 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] [2025-02-05 16:40:05,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 16:40:05,054 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:40:05,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:05,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1468590217, now seen corresponding path program 1 times [2025-02-05 16:40:05,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:05,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774685638] [2025-02-05 16:40:05,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:05,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:05,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 16:40:05,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 16:40:05,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:05,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:05,121 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:05,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:05,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774685638] [2025-02-05 16:40:05,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774685638] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:05,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:05,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:40:05,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691614319] [2025-02-05 16:40:05,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:05,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:40:05,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:05,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:40:05,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:40:05,123 INFO L87 Difference]: Start difference. First operand 2919 states and 4187 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:05,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:05,140 INFO L93 Difference]: Finished difference Result 6181 states and 8906 transitions. [2025-02-05 16:40:05,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:40:05,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-02-05 16:40:05,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:05,144 INFO L225 Difference]: With dead ends: 6181 [2025-02-05 16:40:05,144 INFO L226 Difference]: Without dead ends: 4145 [2025-02-05 16:40:05,146 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-02-05 16:40:05,146 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 66 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 322 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-02-05 16:40:05,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 322 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:40:05,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4145 states. [2025-02-05 16:40:05,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4145 to 3959. [2025-02-05 16:40:05,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3959 states, 3958 states have (on average 1.4262253663466398) internal successors, (5645), 3958 states have internal predecessors, (5645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:05,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3959 states to 3959 states and 5645 transitions. [2025-02-05 16:40:05,179 INFO L78 Accepts]: Start accepts. Automaton has 3959 states and 5645 transitions. Word has length 97 [2025-02-05 16:40:05,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:05,179 INFO L471 AbstractCegarLoop]: Abstraction has 3959 states and 5645 transitions. [2025-02-05 16:40:05,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:05,179 INFO L276 IsEmpty]: Start isEmpty. Operand 3959 states and 5645 transitions. [2025-02-05 16:40:05,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-05 16:40:05,180 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:05,180 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] [2025-02-05 16:40:05,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 16:40:05,180 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:40:05,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:05,181 INFO L85 PathProgramCache]: Analyzing trace with hash -808002775, now seen corresponding path program 1 times [2025-02-05 16:40:05,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:05,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623127422] [2025-02-05 16:40:05,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:05,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:05,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-05 16:40:05,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 16:40:05,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:05,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:05,265 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:05,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:05,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623127422] [2025-02-05 16:40:05,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623127422] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:05,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:05,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:40:05,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33402267] [2025-02-05 16:40:05,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:05,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:40:05,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:05,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:40:05,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:40:05,268 INFO L87 Difference]: Start difference. First operand 3959 states and 5645 transitions. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:05,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:05,451 INFO L93 Difference]: Finished difference Result 10165 states and 14665 transitions. [2025-02-05 16:40:05,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:40:05,451 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2025-02-05 16:40:05,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:05,456 INFO L225 Difference]: With dead ends: 10165 [2025-02-05 16:40:05,456 INFO L226 Difference]: Without dead ends: 6323 [2025-02-05 16:40:05,459 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-02-05 16:40:05,459 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 699 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:05,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 320 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:40:05,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6323 states. [2025-02-05 16:40:05,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6323 to 4373. [2025-02-05 16:40:05,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4373 states, 4372 states have (on average 1.4226898444647758) internal successors, (6220), 4372 states have internal predecessors, (6220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:05,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4373 states to 4373 states and 6220 transitions. [2025-02-05 16:40:05,500 INFO L78 Accepts]: Start accepts. Automaton has 4373 states and 6220 transitions. Word has length 99 [2025-02-05 16:40:05,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:05,500 INFO L471 AbstractCegarLoop]: Abstraction has 4373 states and 6220 transitions. [2025-02-05 16:40:05,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:05,501 INFO L276 IsEmpty]: Start isEmpty. Operand 4373 states and 6220 transitions. [2025-02-05 16:40:05,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-05 16:40:05,501 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:05,501 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] [2025-02-05 16:40:05,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 16:40:05,502 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:40:05,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:05,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1462439927, now seen corresponding path program 1 times [2025-02-05 16:40:05,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:05,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365969108] [2025-02-05 16:40:05,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:05,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:05,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-05 16:40:05,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 16:40:05,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:05,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:05,607 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:05,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:05,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365969108] [2025-02-05 16:40:05,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365969108] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:05,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:05,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:40:05,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873742745] [2025-02-05 16:40:05,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:05,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:40:05,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:05,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:40:05,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:40:05,608 INFO L87 Difference]: Start difference. First operand 4373 states and 6220 transitions. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:05,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:05,811 INFO L93 Difference]: Finished difference Result 16209 states and 23396 transitions. [2025-02-05 16:40:05,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:40:05,811 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2025-02-05 16:40:05,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:05,823 INFO L225 Difference]: With dead ends: 16209 [2025-02-05 16:40:05,823 INFO L226 Difference]: Without dead ends: 11971 [2025-02-05 16:40:05,830 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-02-05 16:40:05,831 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 799 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:05,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 270 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:40:05,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11971 states. [2025-02-05 16:40:05,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11971 to 9449. [2025-02-05 16:40:05,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9449 states, 9448 states have (on average 1.4249576629974599) internal successors, (13463), 9448 states have internal predecessors, (13463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:05,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9449 states to 9449 states and 13463 transitions. [2025-02-05 16:40:05,930 INFO L78 Accepts]: Start accepts. Automaton has 9449 states and 13463 transitions. Word has length 99 [2025-02-05 16:40:05,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:05,930 INFO L471 AbstractCegarLoop]: Abstraction has 9449 states and 13463 transitions. [2025-02-05 16:40:05,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:05,931 INFO L276 IsEmpty]: Start isEmpty. Operand 9449 states and 13463 transitions. [2025-02-05 16:40:05,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-05 16:40:05,931 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:05,931 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] [2025-02-05 16:40:05,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 16:40:05,931 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:40:05,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:05,932 INFO L85 PathProgramCache]: Analyzing trace with hash -211927641, now seen corresponding path program 1 times [2025-02-05 16:40:05,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:05,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353524166] [2025-02-05 16:40:05,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:05,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:05,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-05 16:40:05,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 16:40:05,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:05,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:06,015 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:06,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:06,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353524166] [2025-02-05 16:40:06,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353524166] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:06,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:06,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:40:06,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628600567] [2025-02-05 16:40:06,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:06,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:40:06,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:06,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:40:06,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:40:06,018 INFO L87 Difference]: Start difference. First operand 9449 states and 13463 transitions. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:06,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:06,223 INFO L93 Difference]: Finished difference Result 31437 states and 45125 transitions. [2025-02-05 16:40:06,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:40:06,223 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2025-02-05 16:40:06,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:06,244 INFO L225 Difference]: With dead ends: 31437 [2025-02-05 16:40:06,245 INFO L226 Difference]: Without dead ends: 22123 [2025-02-05 16:40:06,256 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-02-05 16:40:06,256 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 714 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:06,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 268 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:40:06,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22123 states. [2025-02-05 16:40:06,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22123 to 20441. [2025-02-05 16:40:06,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20441 states, 20440 states have (on average 1.4249021526418786) internal successors, (29125), 20440 states have internal predecessors, (29125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:06,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20441 states to 20441 states and 29125 transitions. [2025-02-05 16:40:06,512 INFO L78 Accepts]: Start accepts. Automaton has 20441 states and 29125 transitions. Word has length 99 [2025-02-05 16:40:06,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:06,512 INFO L471 AbstractCegarLoop]: Abstraction has 20441 states and 29125 transitions. [2025-02-05 16:40:06,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:06,512 INFO L276 IsEmpty]: Start isEmpty. Operand 20441 states and 29125 transitions. [2025-02-05 16:40:06,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-05 16:40:06,517 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:06,517 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:40:06,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-05 16:40:06,518 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:40:06,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:06,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1427023617, now seen corresponding path program 1 times [2025-02-05 16:40:06,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:06,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785262828] [2025-02-05 16:40:06,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:06,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:06,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-05 16:40:06,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-05 16:40:06,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:06,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:06,627 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-05 16:40:06,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:06,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785262828] [2025-02-05 16:40:06,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785262828] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:06,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:06,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:40:06,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670170495] [2025-02-05 16:40:06,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:06,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:40:06,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:06,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:40:06,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:40:06,629 INFO L87 Difference]: Start difference. First operand 20441 states and 29125 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:06,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:06,704 INFO L93 Difference]: Finished difference Result 38973 states and 55395 transitions. [2025-02-05 16:40:06,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:40:06,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2025-02-05 16:40:06,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:06,722 INFO L225 Difference]: With dead ends: 38973 [2025-02-05 16:40:06,722 INFO L226 Difference]: Without dead ends: 18661 [2025-02-05 16:40:06,740 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-02-05 16:40:06,741 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 59 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 313 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-02-05 16:40:06,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 313 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:40:06,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18661 states. [2025-02-05 16:40:06,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18661 to 18119. [2025-02-05 16:40:06,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18119 states, 18118 states have (on average 1.406336240203113) internal successors, (25480), 18118 states have internal predecessors, (25480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:06,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18119 states to 18119 states and 25480 transitions. [2025-02-05 16:40:06,906 INFO L78 Accepts]: Start accepts. Automaton has 18119 states and 25480 transitions. Word has length 122 [2025-02-05 16:40:06,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:06,906 INFO L471 AbstractCegarLoop]: Abstraction has 18119 states and 25480 transitions. [2025-02-05 16:40:06,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:06,907 INFO L276 IsEmpty]: Start isEmpty. Operand 18119 states and 25480 transitions. [2025-02-05 16:40:06,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 16:40:06,910 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:06,910 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-02-05 16:40:06,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-05 16:40:06,910 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:40:06,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:06,911 INFO L85 PathProgramCache]: Analyzing trace with hash 992636389, now seen corresponding path program 1 times [2025-02-05 16:40:06,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:06,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984922518] [2025-02-05 16:40:06,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:06,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:06,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 16:40:06,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 16:40:06,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:06,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:06,998 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-05 16:40:06,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:06,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984922518] [2025-02-05 16:40:06,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984922518] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:06,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:06,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:40:06,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364923897] [2025-02-05 16:40:06,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:06,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:40:06,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:07,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:40:07,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:40:07,000 INFO L87 Difference]: Start difference. First operand 18119 states and 25480 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:07,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:07,129 INFO L93 Difference]: Finished difference Result 34359 states and 48146 transitions. [2025-02-05 16:40:07,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:40:07,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 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 123 [2025-02-05 16:40:07,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:07,146 INFO L225 Difference]: With dead ends: 34359 [2025-02-05 16:40:07,146 INFO L226 Difference]: Without dead ends: 16357 [2025-02-05 16:40:07,154 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-02-05 16:40:07,155 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 52 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 314 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-02-05 16:40:07,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 314 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:40:07,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16357 states. [2025-02-05 16:40:07,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16357 to 15851. [2025-02-05 16:40:07,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15851 states, 15850 states have (on average 1.3849842271293376) internal successors, (21952), 15850 states have internal predecessors, (21952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:07,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15851 states to 15851 states and 21952 transitions. [2025-02-05 16:40:07,295 INFO L78 Accepts]: Start accepts. Automaton has 15851 states and 21952 transitions. Word has length 123 [2025-02-05 16:40:07,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:07,296 INFO L471 AbstractCegarLoop]: Abstraction has 15851 states and 21952 transitions. [2025-02-05 16:40:07,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:07,296 INFO L276 IsEmpty]: Start isEmpty. Operand 15851 states and 21952 transitions. [2025-02-05 16:40:07,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-05 16:40:07,299 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:07,299 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-02-05 16:40:07,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-05 16:40:07,299 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:40:07,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:07,300 INFO L85 PathProgramCache]: Analyzing trace with hash -529097876, now seen corresponding path program 1 times [2025-02-05 16:40:07,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:07,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809496502] [2025-02-05 16:40:07,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:07,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:07,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 16:40:07,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 16:40:07,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:07,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:07,377 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 16:40:07,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:07,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809496502] [2025-02-05 16:40:07,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809496502] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:07,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:07,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:40:07,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671401353] [2025-02-05 16:40:07,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:07,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:40:07,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:07,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:40:07,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:40:07,379 INFO L87 Difference]: Start difference. First operand 15851 states and 21952 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:07,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:07,453 INFO L93 Difference]: Finished difference Result 45471 states and 62578 transitions. [2025-02-05 16:40:07,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:40:07,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2025-02-05 16:40:07,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:07,490 INFO L225 Difference]: With dead ends: 45471 [2025-02-05 16:40:07,490 INFO L226 Difference]: Without dead ends: 29737 [2025-02-05 16:40:07,507 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-02-05 16:40:07,507 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 45 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 315 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-02-05 16:40:07,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 315 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:40:07,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29737 states. [2025-02-05 16:40:07,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29737 to 27383. [2025-02-05 16:40:07,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27383 states, 27382 states have (on average 1.3655686217222993) internal successors, (37392), 27382 states have internal predecessors, (37392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:07,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27383 states to 27383 states and 37392 transitions. [2025-02-05 16:40:07,831 INFO L78 Accepts]: Start accepts. Automaton has 27383 states and 37392 transitions. Word has length 124 [2025-02-05 16:40:07,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:07,832 INFO L471 AbstractCegarLoop]: Abstraction has 27383 states and 37392 transitions. [2025-02-05 16:40:07,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:07,832 INFO L276 IsEmpty]: Start isEmpty. Operand 27383 states and 37392 transitions. [2025-02-05 16:40:07,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-05 16:40:07,835 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:07,835 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-02-05 16:40:07,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-05 16:40:07,835 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:40:07,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:07,836 INFO L85 PathProgramCache]: Analyzing trace with hash 768790385, now seen corresponding path program 1 times [2025-02-05 16:40:07,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:07,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198028223] [2025-02-05 16:40:07,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:07,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:07,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-05 16:40:07,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-05 16:40:07,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:07,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:08,135 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:08,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:08,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198028223] [2025-02-05 16:40:08,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198028223] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:40:08,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039708291] [2025-02-05 16:40:08,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:08,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:40:08,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:40:08,137 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:40:08,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 16:40:08,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-05 16:40:08,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-05 16:40:08,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:08,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:08,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-05 16:40:08,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:40:09,201 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:09,202 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:40:10,369 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:10,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039708291] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:40:10,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:40:10,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2025-02-05 16:40:10,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354325740] [2025-02-05 16:40:10,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:40:10,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-05 16:40:10,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:10,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-05 16:40:10,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=693, Unknown=0, NotChecked=0, Total=812 [2025-02-05 16:40:10,371 INFO L87 Difference]: Start difference. First operand 27383 states and 37392 transitions. Second operand has 29 states, 29 states have (on average 10.96551724137931) internal successors, (318), 28 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:11,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:11,705 INFO L93 Difference]: Finished difference Result 114618 states and 156909 transitions. [2025-02-05 16:40:11,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-05 16:40:11,706 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 10.96551724137931) internal successors, (318), 28 states have internal predecessors, (318), 0 states have call successors, (0), 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 125 [2025-02-05 16:40:11,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:11,803 INFO L225 Difference]: With dead ends: 114618 [2025-02-05 16:40:11,803 INFO L226 Difference]: Without dead ends: 87352 [2025-02-05 16:40:11,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=555, Invalid=1895, Unknown=0, NotChecked=0, Total=2450 [2025-02-05 16:40:11,840 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 1075 mSDsluCounter, 1196 mSDsCounter, 0 mSdLazyCounter, 1299 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1075 SdHoareTripleChecker+Valid, 1320 SdHoareTripleChecker+Invalid, 1333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:11,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1075 Valid, 1320 Invalid, 1333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1299 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:40:11,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87352 states. [2025-02-05 16:40:12,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87352 to 65940. [2025-02-05 16:40:12,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65940 states, 65939 states have (on average 1.3616221052791215) internal successors, (89784), 65939 states have internal predecessors, (89784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:13,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65940 states to 65940 states and 89784 transitions. [2025-02-05 16:40:13,086 INFO L78 Accepts]: Start accepts. Automaton has 65940 states and 89784 transitions. Word has length 125 [2025-02-05 16:40:13,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:13,087 INFO L471 AbstractCegarLoop]: Abstraction has 65940 states and 89784 transitions. [2025-02-05 16:40:13,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 10.96551724137931) internal successors, (318), 28 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:13,087 INFO L276 IsEmpty]: Start isEmpty. Operand 65940 states and 89784 transitions. [2025-02-05 16:40:13,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-05 16:40:13,094 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:13,094 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:13,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 16:40:13,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:40:13,295 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:40:13,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:13,295 INFO L85 PathProgramCache]: Analyzing trace with hash 123657857, now seen corresponding path program 1 times [2025-02-05 16:40:13,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:13,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896955002] [2025-02-05 16:40:13,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:13,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:13,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-05 16:40:13,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-05 16:40:13,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:13,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:13,528 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:13,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:13,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896955002] [2025-02-05 16:40:13,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896955002] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:40:13,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092281835] [2025-02-05 16:40:13,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:13,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:40:13,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:40:13,534 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:40:13,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 16:40:13,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-05 16:40:13,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-05 16:40:13,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:13,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:13,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-05 16:40:13,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:40:14,481 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:14,481 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:40:15,471 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:15,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092281835] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:40:15,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:40:15,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 29 [2025-02-05 16:40:15,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797201154] [2025-02-05 16:40:15,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:40:15,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-05 16:40:15,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:15,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-05 16:40:15,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=721, Unknown=0, NotChecked=0, Total=870 [2025-02-05 16:40:15,473 INFO L87 Difference]: Start difference. First operand 65940 states and 89784 transitions. Second operand has 30 states, 30 states have (on average 10.7) internal successors, (321), 29 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:18,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:18,348 INFO L93 Difference]: Finished difference Result 247442 states and 334987 transitions. [2025-02-05 16:40:18,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-02-05 16:40:18,348 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 10.7) internal successors, (321), 29 states have internal predecessors, (321), 0 states have call successors, (0), 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 126 [2025-02-05 16:40:18,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:18,662 INFO L225 Difference]: With dead ends: 247442 [2025-02-05 16:40:18,662 INFO L226 Difference]: Without dead ends: 220176 [2025-02-05 16:40:18,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1946 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1724, Invalid=5932, Unknown=0, NotChecked=0, Total=7656 [2025-02-05 16:40:18,737 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 4131 mSDsluCounter, 1577 mSDsCounter, 0 mSdLazyCounter, 1988 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4131 SdHoareTripleChecker+Valid, 1750 SdHoareTripleChecker+Invalid, 2065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:18,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4131 Valid, 1750 Invalid, 2065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1988 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 16:40:18,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220176 states. [2025-02-05 16:40:20,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220176 to 65891. [2025-02-05 16:40:20,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65891 states, 65890 states have (on average 1.361815146456215) internal successors, (89730), 65890 states have internal predecessors, (89730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:20,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65891 states to 65891 states and 89730 transitions. [2025-02-05 16:40:20,257 INFO L78 Accepts]: Start accepts. Automaton has 65891 states and 89730 transitions. Word has length 126 [2025-02-05 16:40:20,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:20,258 INFO L471 AbstractCegarLoop]: Abstraction has 65891 states and 89730 transitions. [2025-02-05 16:40:20,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 10.7) internal successors, (321), 29 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:20,258 INFO L276 IsEmpty]: Start isEmpty. Operand 65891 states and 89730 transitions. [2025-02-05 16:40:20,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-05 16:40:20,263 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:20,263 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 16:40:20,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 16:40:20,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:40:20,463 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:40:20,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:20,464 INFO L85 PathProgramCache]: Analyzing trace with hash 532701224, now seen corresponding path program 1 times [2025-02-05 16:40:20,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:20,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326773840] [2025-02-05 16:40:20,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:20,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:20,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-05 16:40:20,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-05 16:40:20,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:20,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:21,141 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:21,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:21,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326773840] [2025-02-05 16:40:21,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326773840] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:40:21,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821367936] [2025-02-05 16:40:21,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:21,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:40:21,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:40:21,144 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:40:21,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 16:40:21,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-05 16:40:21,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-05 16:40:21,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:21,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:21,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-05 16:40:21,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:40:23,348 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:23,348 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:40:25,855 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:25,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821367936] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:40:25,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:40:25,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 17] total 46 [2025-02-05 16:40:25,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980349750] [2025-02-05 16:40:25,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:40:25,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-02-05 16:40:25,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:25,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-02-05 16:40:25,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1955, Unknown=0, NotChecked=0, Total=2162 [2025-02-05 16:40:25,857 INFO L87 Difference]: Start difference. First operand 65891 states and 89730 transitions. Second operand has 47 states, 47 states have (on average 7.51063829787234) internal successors, (353), 46 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)