./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2f774b3e755d7b6f786f7d23823d008ce09be620750647481355094233fd1ac8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:05:25,567 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:05:25,627 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:05:25,630 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:05:25,632 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:05:25,655 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:05:25,656 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:05:25,657 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:05:25,657 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:05:25,657 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:05:25,658 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:05:25,658 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:05:25,658 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:05:25,658 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:05:25,659 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:05:25,659 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:05:25,659 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:05:25,659 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:05:25,659 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:05:25,659 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:05:25,659 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:05:25,659 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:05:25,659 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:05:25,660 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:05:25,660 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:05:25,660 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:05:25,660 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:05:25,660 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:05:25,660 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:05:25,660 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:05:25,660 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:05:25,660 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:05:25,660 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:05:25,661 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:05:25,661 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:05:25,661 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:05:25,661 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:05:25,661 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:05:25,661 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:05:25,661 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:05:25,661 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:05:25,661 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:05:25,661 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:05:25,662 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2f774b3e755d7b6f786f7d23823d008ce09be620750647481355094233fd1ac8 [2025-03-03 15:05:25,891 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:05:25,899 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:05:25,901 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:05:25,903 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:05:25,903 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:05:25,904 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2025-03-03 15:05:27,055 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f79c1d89/bd696a4fb98142ab967265636645c649/FLAG16477c885 [2025-03-03 15:05:27,307 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:05:27,308 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2025-03-03 15:05:27,321 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f79c1d89/bd696a4fb98142ab967265636645c649/FLAG16477c885 [2025-03-03 15:05:27,630 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f79c1d89/bd696a4fb98142ab967265636645c649 [2025-03-03 15:05:27,632 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:05:27,633 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:05:27,634 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:05:27,634 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:05:27,637 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:05:27,637 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:05:27" (1/1) ... [2025-03-03 15:05:27,638 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f60f125 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:05:27, skipping insertion in model container [2025-03-03 15:05:27,638 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:05:27" (1/1) ... [2025-03-03 15:05:27,662 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:05:27,793 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[7471,7484] [2025-03-03 15:05:27,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:05:27,838 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:05:27,883 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[7471,7484] [2025-03-03 15:05:27,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:05:27,918 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:05:27,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:05:27 WrapperNode [2025-03-03 15:05:27,919 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:05:27,921 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:05:27,921 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:05:27,921 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:05:27,925 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:05:27" (1/1) ... [2025-03-03 15:05:27,932 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:05:27" (1/1) ... [2025-03-03 15:05:27,959 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 626 [2025-03-03 15:05:27,959 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:05:27,960 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:05:27,960 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:05:27,960 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:05:27,966 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:05:27" (1/1) ... [2025-03-03 15:05:27,966 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:05:27" (1/1) ... [2025-03-03 15:05:27,968 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:05:27" (1/1) ... [2025-03-03 15:05:27,980 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 15:05:27,981 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:05:27" (1/1) ... [2025-03-03 15:05:27,981 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:05:27" (1/1) ... [2025-03-03 15:05:27,986 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:05:27" (1/1) ... [2025-03-03 15:05:27,987 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:05:27" (1/1) ... [2025-03-03 15:05:27,988 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:05:27" (1/1) ... [2025-03-03 15:05:27,989 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:05:27" (1/1) ... [2025-03-03 15:05:27,991 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:05:27,995 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:05:27,995 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:05:27,995 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:05:27,996 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:05:27" (1/1) ... [2025-03-03 15:05:27,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:05:28,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:05:28,020 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 15:05:28,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 15:05:28,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:05:28,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:05:28,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:05:28,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:05:28,131 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:05:28,132 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:05:28,656 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L334: havoc main_~node2__m2~2#1; [2025-03-03 15:05:28,656 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L715: havoc main_~node1____CPAchecker_TMP_0~2#1; [2025-03-03 15:05:28,657 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L352: havoc main_~node3__m3~2#1; [2025-03-03 15:05:28,657 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L455: havoc main_~node1____CPAchecker_TMP_0~1#1;havoc main_~node1__m1~3#1;havoc main_~main____CPAchecker_TMP_0~2#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-03-03 15:05:28,657 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L158: havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-03 15:05:28,657 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L571: havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-03-03 15:05:28,657 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L935: havoc main_~node2____CPAchecker_TMP_1~1#1; [2025-03-03 15:05:28,657 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L657: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-03-03 15:05:28,657 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L179: havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-03 15:05:28,657 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L543: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-03 15:05:28,657 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L312: havoc main_~node1__m1~2#1;havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1;havoc main_~node3__m3~1#1;havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1;havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-03 15:05:28,657 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L891: havoc main_~node3____CPAchecker_TMP_1~1#1; [2025-03-03 15:05:28,657 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L629: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-03 15:05:28,684 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2025-03-03 15:05:28,684 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:05:28,698 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:05:28,700 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:05:28,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:05:28 BoogieIcfgContainer [2025-03-03 15:05:28,700 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:05:28,702 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:05:28,702 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:05:28,705 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:05:28,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:05:27" (1/3) ... [2025-03-03 15:05:28,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ea33c4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:05:28, skipping insertion in model container [2025-03-03 15:05:28,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:05:27" (2/3) ... [2025-03-03 15:05:28,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ea33c4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:05:28, skipping insertion in model container [2025-03-03 15:05:28,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:05:28" (3/3) ... [2025-03-03 15:05:28,707 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2025-03-03 15:05:28,717 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:05:28,720 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c that has 1 procedures, 148 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-03 15:05:28,756 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:05:28,764 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;@293553cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:05:28,764 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 15:05:28,768 INFO L276 IsEmpty]: Start isEmpty. Operand has 148 states, 146 states have (on average 1.7123287671232876) internal successors, (250), 147 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:28,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-03 15:05:28,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:28,773 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] [2025-03-03 15:05:28,773 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:28,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:28,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1004141142, now seen corresponding path program 1 times [2025-03-03 15:05:28,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:28,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205956314] [2025-03-03 15:05:28,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:28,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:28,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-03 15:05:28,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-03 15:05:28,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:28,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:29,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:29,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:29,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205956314] [2025-03-03 15:05:29,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205956314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:29,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:29,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:05:29,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443869714] [2025-03-03 15:05:29,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:29,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:05:29,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:29,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:05:29,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:05:29,292 INFO L87 Difference]: Start difference. First operand has 148 states, 146 states have (on average 1.7123287671232876) internal successors, (250), 147 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:29,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:29,471 INFO L93 Difference]: Finished difference Result 468 states and 757 transitions. [2025-03-03 15:05:29,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:05:29,474 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2025-03-03 15:05:29,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:29,484 INFO L225 Difference]: With dead ends: 468 [2025-03-03 15:05:29,484 INFO L226 Difference]: Without dead ends: 394 [2025-03-03 15:05:29,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:05:29,491 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 829 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 829 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:29,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [829 Valid, 1145 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:05:29,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2025-03-03 15:05:29,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 232. [2025-03-03 15:05:29,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 231 states have (on average 1.4891774891774892) internal successors, (344), 231 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:29,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 344 transitions. [2025-03-03 15:05:29,530 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 344 transitions. Word has length 49 [2025-03-03 15:05:29,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:29,531 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 344 transitions. [2025-03-03 15:05:29,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:29,531 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 344 transitions. [2025-03-03 15:05:29,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-03 15:05:29,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:29,533 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] [2025-03-03 15:05:29,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:05:29,534 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:29,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:29,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1432785625, now seen corresponding path program 1 times [2025-03-03 15:05:29,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:29,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929780405] [2025-03-03 15:05:29,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:29,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:29,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-03 15:05:29,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-03 15:05:29,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:29,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:29,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:29,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:29,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929780405] [2025-03-03 15:05:29,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929780405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:29,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:29,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:05:29,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616278252] [2025-03-03 15:05:29,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:29,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:05:29,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:29,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:05:29,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:05:29,653 INFO L87 Difference]: Start difference. First operand 232 states and 344 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:29,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:29,687 INFO L93 Difference]: Finished difference Result 584 states and 884 transitions. [2025-03-03 15:05:29,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:05:29,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2025-03-03 15:05:29,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:29,689 INFO L225 Difference]: With dead ends: 584 [2025-03-03 15:05:29,690 INFO L226 Difference]: Without dead ends: 406 [2025-03-03 15:05:29,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:05:29,691 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 137 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:29,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 398 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:05:29,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2025-03-03 15:05:29,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 404. [2025-03-03 15:05:29,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 403 states have (on average 1.478908188585608) internal successors, (596), 403 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:29,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 596 transitions. [2025-03-03 15:05:29,707 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 596 transitions. Word has length 52 [2025-03-03 15:05:29,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:29,708 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 596 transitions. [2025-03-03 15:05:29,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:29,708 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 596 transitions. [2025-03-03 15:05:29,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-03 15:05:29,709 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:29,709 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] [2025-03-03 15:05:29,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:05:29,709 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:29,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:29,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1668726728, now seen corresponding path program 1 times [2025-03-03 15:05:29,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:29,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322175195] [2025-03-03 15:05:29,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:29,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:29,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-03 15:05:29,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-03 15:05:29,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:29,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:29,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:29,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:29,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322175195] [2025-03-03 15:05:29,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322175195] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:29,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:29,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:05:29,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793366926] [2025-03-03 15:05:29,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:29,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:05:29,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:29,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:05:29,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:05:29,788 INFO L87 Difference]: Start difference. First operand 404 states and 596 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:29,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:29,812 INFO L93 Difference]: Finished difference Result 1014 states and 1513 transitions. [2025-03-03 15:05:29,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:05:29,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2025-03-03 15:05:29,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:29,815 INFO L225 Difference]: With dead ends: 1014 [2025-03-03 15:05:29,815 INFO L226 Difference]: Without dead ends: 706 [2025-03-03 15:05:29,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:05:29,818 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 141 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:29,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 390 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:05:29,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2025-03-03 15:05:29,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 704. [2025-03-03 15:05:29,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 703 states have (on average 1.465149359886202) internal successors, (1030), 703 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:29,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 1030 transitions. [2025-03-03 15:05:29,840 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 1030 transitions. Word has length 52 [2025-03-03 15:05:29,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:29,840 INFO L471 AbstractCegarLoop]: Abstraction has 704 states and 1030 transitions. [2025-03-03 15:05:29,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:29,841 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 1030 transitions. [2025-03-03 15:05:29,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-03 15:05:29,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:29,844 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] [2025-03-03 15:05:29,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:05:29,844 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:29,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:29,846 INFO L85 PathProgramCache]: Analyzing trace with hash -432429255, now seen corresponding path program 1 times [2025-03-03 15:05:29,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:29,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678831007] [2025-03-03 15:05:29,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:29,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:29,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-03 15:05:29,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-03 15:05:29,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:29,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:29,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:29,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:29,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678831007] [2025-03-03 15:05:29,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678831007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:29,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:29,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:05:29,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469322169] [2025-03-03 15:05:29,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:29,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:05:29,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:29,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:05:29,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:05:29,942 INFO L87 Difference]: Start difference. First operand 704 states and 1030 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:29,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:29,969 INFO L93 Difference]: Finished difference Result 1735 states and 2549 transitions. [2025-03-03 15:05:29,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:05:29,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2025-03-03 15:05:29,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:29,973 INFO L225 Difference]: With dead ends: 1735 [2025-03-03 15:05:29,973 INFO L226 Difference]: Without dead ends: 1211 [2025-03-03 15:05:29,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:05:29,976 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 128 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:29,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 407 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:05:29,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2025-03-03 15:05:30,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 1209. [2025-03-03 15:05:30,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1209 states, 1208 states have (on average 1.4403973509933774) internal successors, (1740), 1208 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:30,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 1740 transitions. [2025-03-03 15:05:30,010 INFO L78 Accepts]: Start accepts. Automaton has 1209 states and 1740 transitions. Word has length 52 [2025-03-03 15:05:30,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:30,011 INFO L471 AbstractCegarLoop]: Abstraction has 1209 states and 1740 transitions. [2025-03-03 15:05:30,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:30,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1740 transitions. [2025-03-03 15:05:30,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-03 15:05:30,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:30,013 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:30,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:05:30,015 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:30,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:30,015 INFO L85 PathProgramCache]: Analyzing trace with hash -52933898, now seen corresponding path program 1 times [2025-03-03 15:05:30,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:30,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027146240] [2025-03-03 15:05:30,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:30,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:30,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-03 15:05:30,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 15:05:30,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:30,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:30,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:30,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:30,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027146240] [2025-03-03 15:05:30,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027146240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:30,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:30,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:05:30,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361471082] [2025-03-03 15:05:30,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:30,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:05:30,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:30,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:05:30,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:05:30,155 INFO L87 Difference]: Start difference. First operand 1209 states and 1740 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:30,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:30,231 INFO L93 Difference]: Finished difference Result 2352 states and 3451 transitions. [2025-03-03 15:05:30,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:05:30,231 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-03-03 15:05:30,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:30,240 INFO L225 Difference]: With dead ends: 2352 [2025-03-03 15:05:30,240 INFO L226 Difference]: Without dead ends: 2006 [2025-03-03 15:05:30,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:05:30,242 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 563 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:30,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 828 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:05:30,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2006 states. [2025-03-03 15:05:30,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2006 to 1604. [2025-03-03 15:05:30,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1604 states, 1603 states have (on average 1.4472863381160324) internal successors, (2320), 1603 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:30,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2320 transitions. [2025-03-03 15:05:30,278 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2320 transitions. Word has length 53 [2025-03-03 15:05:30,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:30,278 INFO L471 AbstractCegarLoop]: Abstraction has 1604 states and 2320 transitions. [2025-03-03 15:05:30,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:30,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2320 transitions. [2025-03-03 15:05:30,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-03 15:05:30,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:30,283 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:30,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:05:30,283 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:30,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:30,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1871306335, now seen corresponding path program 1 times [2025-03-03 15:05:30,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:30,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493960897] [2025-03-03 15:05:30,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:30,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:30,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-03 15:05:30,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 15:05:30,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:30,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:30,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:30,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:30,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493960897] [2025-03-03 15:05:30,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493960897] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:30,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:30,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:05:30,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595261557] [2025-03-03 15:05:30,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:30,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:05:30,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:30,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:05:30,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:05:30,417 INFO L87 Difference]: Start difference. First operand 1604 states and 2320 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:30,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:30,506 INFO L93 Difference]: Finished difference Result 2726 states and 4001 transitions. [2025-03-03 15:05:30,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:05:30,506 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-03-03 15:05:30,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:30,514 INFO L225 Difference]: With dead ends: 2726 [2025-03-03 15:05:30,514 INFO L226 Difference]: Without dead ends: 2380 [2025-03-03 15:05:30,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:05:30,516 INFO L435 NwaCegarLoop]: 379 mSDtfsCounter, 555 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:30,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 929 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:05:30,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2380 states. [2025-03-03 15:05:30,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2380 to 1925. [2025-03-03 15:05:30,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1924 states have (on average 1.4527027027027026) internal successors, (2795), 1924 states have internal predecessors, (2795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:30,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 2795 transitions. [2025-03-03 15:05:30,550 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 2795 transitions. Word has length 53 [2025-03-03 15:05:30,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:30,550 INFO L471 AbstractCegarLoop]: Abstraction has 1925 states and 2795 transitions. [2025-03-03 15:05:30,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:30,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 2795 transitions. [2025-03-03 15:05:30,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-03 15:05:30,551 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:30,551 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:30,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:05:30,551 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:30,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:30,552 INFO L85 PathProgramCache]: Analyzing trace with hash 436101952, now seen corresponding path program 1 times [2025-03-03 15:05:30,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:30,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649068131] [2025-03-03 15:05:30,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:30,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:30,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-03 15:05:30,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-03 15:05:30,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:30,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:30,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:30,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:30,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649068131] [2025-03-03 15:05:30,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649068131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:30,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:30,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:05:30,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62194025] [2025-03-03 15:05:30,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:30,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:05:30,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:30,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:05:30,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:05:30,655 INFO L87 Difference]: Start difference. First operand 1925 states and 2795 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:30,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:30,733 INFO L93 Difference]: Finished difference Result 3143 states and 4614 transitions. [2025-03-03 15:05:30,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:05:30,733 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-03-03 15:05:30,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:30,741 INFO L225 Difference]: With dead ends: 3143 [2025-03-03 15:05:30,741 INFO L226 Difference]: Without dead ends: 2797 [2025-03-03 15:05:30,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:05:30,744 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 564 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:30,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 890 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:05:30,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2797 states. [2025-03-03 15:05:30,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2797 to 2223. [2025-03-03 15:05:30,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2223 states, 2222 states have (on average 1.4572457245724573) internal successors, (3238), 2222 states have internal predecessors, (3238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:30,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2223 states to 2223 states and 3238 transitions. [2025-03-03 15:05:30,786 INFO L78 Accepts]: Start accepts. Automaton has 2223 states and 3238 transitions. Word has length 54 [2025-03-03 15:05:30,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:30,786 INFO L471 AbstractCegarLoop]: Abstraction has 2223 states and 3238 transitions. [2025-03-03 15:05:30,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:30,787 INFO L276 IsEmpty]: Start isEmpty. Operand 2223 states and 3238 transitions. [2025-03-03 15:05:30,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 15:05:30,790 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:30,790 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] [2025-03-03 15:05:30,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:05:30,791 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:30,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:30,791 INFO L85 PathProgramCache]: Analyzing trace with hash 5990947, now seen corresponding path program 1 times [2025-03-03 15:05:30,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:30,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124965421] [2025-03-03 15:05:30,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:30,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:30,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 15:05:30,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 15:05:30,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:30,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:30,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:30,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:30,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124965421] [2025-03-03 15:05:30,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124965421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:30,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:30,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:05:30,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999599237] [2025-03-03 15:05:30,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:30,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:05:30,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:30,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:05:30,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:05:30,883 INFO L87 Difference]: Start difference. First operand 2223 states and 3238 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:31,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:31,048 INFO L93 Difference]: Finished difference Result 5276 states and 7686 transitions. [2025-03-03 15:05:31,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:05:31,049 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2025-03-03 15:05:31,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:31,056 INFO L225 Difference]: With dead ends: 5276 [2025-03-03 15:05:31,057 INFO L226 Difference]: Without dead ends: 3095 [2025-03-03 15:05:31,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:05:31,060 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 799 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:31,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 207 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:05:31,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3095 states. [2025-03-03 15:05:31,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3095 to 3077. [2025-03-03 15:05:31,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3077 states, 3076 states have (on average 1.4447334200260078) internal successors, (4444), 3076 states have internal predecessors, (4444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:31,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3077 states to 3077 states and 4444 transitions. [2025-03-03 15:05:31,103 INFO L78 Accepts]: Start accepts. Automaton has 3077 states and 4444 transitions. Word has length 57 [2025-03-03 15:05:31,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:31,104 INFO L471 AbstractCegarLoop]: Abstraction has 3077 states and 4444 transitions. [2025-03-03 15:05:31,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:31,104 INFO L276 IsEmpty]: Start isEmpty. Operand 3077 states and 4444 transitions. [2025-03-03 15:05:31,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 15:05:31,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:31,107 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:31,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:05:31,107 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:31,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:31,108 INFO L85 PathProgramCache]: Analyzing trace with hash 2003650528, now seen corresponding path program 1 times [2025-03-03 15:05:31,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:31,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273878269] [2025-03-03 15:05:31,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:31,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:31,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 15:05:31,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 15:05:31,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:31,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:31,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:31,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:31,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273878269] [2025-03-03 15:05:31,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273878269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:31,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:31,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:05:31,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833895326] [2025-03-03 15:05:31,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:31,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:05:31,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:31,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:05:31,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:05:31,189 INFO L87 Difference]: Start difference. First operand 3077 states and 4444 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:31,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:31,346 INFO L93 Difference]: Finished difference Result 7194 states and 10361 transitions. [2025-03-03 15:05:31,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:05:31,347 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-03-03 15:05:31,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:31,357 INFO L225 Difference]: With dead ends: 7194 [2025-03-03 15:05:31,357 INFO L226 Difference]: Without dead ends: 4204 [2025-03-03 15:05:31,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:05:31,361 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 798 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 798 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:31,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [798 Valid, 197 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:05:31,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4204 states. [2025-03-03 15:05:31,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4204 to 3077. [2025-03-03 15:05:31,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3077 states, 3076 states have (on average 1.428478543563069) internal successors, (4394), 3076 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-03-03 15:05:31,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3077 states to 3077 states and 4394 transitions. [2025-03-03 15:05:31,443 INFO L78 Accepts]: Start accepts. Automaton has 3077 states and 4394 transitions. Word has length 58 [2025-03-03 15:05:31,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:31,443 INFO L471 AbstractCegarLoop]: Abstraction has 3077 states and 4394 transitions. [2025-03-03 15:05:31,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:31,443 INFO L276 IsEmpty]: Start isEmpty. Operand 3077 states and 4394 transitions. [2025-03-03 15:05:31,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 15:05:31,445 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:31,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] [2025-03-03 15:05:31,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:05:31,445 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:31,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:31,446 INFO L85 PathProgramCache]: Analyzing trace with hash 112198812, now seen corresponding path program 1 times [2025-03-03 15:05:31,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:31,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34750735] [2025-03-03 15:05:31,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:31,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:31,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 15:05:31,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 15:05:31,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:31,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:31,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:31,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:31,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34750735] [2025-03-03 15:05:31,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34750735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:31,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:31,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:05:31,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905145029] [2025-03-03 15:05:31,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:31,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:05:31,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:31,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:05:31,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:05:31,516 INFO L87 Difference]: Start difference. First operand 3077 states and 4394 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:31,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:31,653 INFO L93 Difference]: Finished difference Result 7259 states and 10357 transitions. [2025-03-03 15:05:31,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:05:31,654 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-03-03 15:05:31,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:31,665 INFO L225 Difference]: With dead ends: 7259 [2025-03-03 15:05:31,666 INFO L226 Difference]: Without dead ends: 4260 [2025-03-03 15:05:31,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:05:31,671 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 741 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:31,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 209 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:05:31,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4260 states. [2025-03-03 15:05:31,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4260 to 4235. [2025-03-03 15:05:31,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4235 states, 4234 states have (on average 1.4121398205007085) internal successors, (5979), 4234 states have internal predecessors, (5979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:31,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4235 states to 4235 states and 5979 transitions. [2025-03-03 15:05:31,765 INFO L78 Accepts]: Start accepts. Automaton has 4235 states and 5979 transitions. Word has length 58 [2025-03-03 15:05:31,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:31,765 INFO L471 AbstractCegarLoop]: Abstraction has 4235 states and 5979 transitions. [2025-03-03 15:05:31,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:31,765 INFO L276 IsEmpty]: Start isEmpty. Operand 4235 states and 5979 transitions. [2025-03-03 15:05:31,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 15:05:31,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:31,769 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:31,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:05:31,769 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:31,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:31,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1583565779, now seen corresponding path program 1 times [2025-03-03 15:05:31,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:31,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029895968] [2025-03-03 15:05:31,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:31,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:31,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 15:05:31,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 15:05:31,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:31,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:31,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:31,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:31,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029895968] [2025-03-03 15:05:31,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029895968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:31,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:31,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:05:31,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577952647] [2025-03-03 15:05:31,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:31,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:05:31,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:31,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:05:31,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:05:31,902 INFO L87 Difference]: Start difference. First operand 4235 states and 5979 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:32,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:32,168 INFO L93 Difference]: Finished difference Result 10180 states and 14327 transitions. [2025-03-03 15:05:32,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:05:32,171 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-03-03 15:05:32,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:32,199 INFO L225 Difference]: With dead ends: 10180 [2025-03-03 15:05:32,199 INFO L226 Difference]: Without dead ends: 8810 [2025-03-03 15:05:32,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:05:32,206 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 1342 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1342 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:32,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1342 Valid, 365 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:05:32,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8810 states. [2025-03-03 15:05:32,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8810 to 4247. [2025-03-03 15:05:32,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4247 states, 4246 states have (on average 1.4119170984455958) internal successors, (5995), 4246 states have internal predecessors, (5995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:32,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4247 states to 4247 states and 5995 transitions. [2025-03-03 15:05:32,318 INFO L78 Accepts]: Start accepts. Automaton has 4247 states and 5995 transitions. Word has length 59 [2025-03-03 15:05:32,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:32,318 INFO L471 AbstractCegarLoop]: Abstraction has 4247 states and 5995 transitions. [2025-03-03 15:05:32,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:32,319 INFO L276 IsEmpty]: Start isEmpty. Operand 4247 states and 5995 transitions. [2025-03-03 15:05:32,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-03 15:05:32,322 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:32,322 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:32,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:05:32,322 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:32,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:32,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1061923100, now seen corresponding path program 1 times [2025-03-03 15:05:32,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:32,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589111594] [2025-03-03 15:05:32,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:32,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:32,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 15:05:32,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 15:05:32,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:32,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:32,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:32,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:32,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589111594] [2025-03-03 15:05:32,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589111594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:32,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:32,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:05:32,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388070942] [2025-03-03 15:05:32,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:32,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:05:32,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:32,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:05:32,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:05:32,437 INFO L87 Difference]: Start difference. First operand 4247 states and 5995 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:32,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:32,683 INFO L93 Difference]: Finished difference Result 11047 states and 15556 transitions. [2025-03-03 15:05:32,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:05:32,683 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-03-03 15:05:32,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:32,697 INFO L225 Difference]: With dead ends: 11047 [2025-03-03 15:05:32,697 INFO L226 Difference]: Without dead ends: 9001 [2025-03-03 15:05:32,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:05:32,703 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 1172 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1172 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:32,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1172 Valid, 347 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:05:32,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9001 states. [2025-03-03 15:05:32,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9001 to 4325. [2025-03-03 15:05:32,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4325 states, 4324 states have (on average 1.4095744680851063) internal successors, (6095), 4324 states have internal predecessors, (6095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:32,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4325 states to 4325 states and 6095 transitions. [2025-03-03 15:05:32,796 INFO L78 Accepts]: Start accepts. Automaton has 4325 states and 6095 transitions. Word has length 60 [2025-03-03 15:05:32,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:32,796 INFO L471 AbstractCegarLoop]: Abstraction has 4325 states and 6095 transitions. [2025-03-03 15:05:32,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:32,797 INFO L276 IsEmpty]: Start isEmpty. Operand 4325 states and 6095 transitions. [2025-03-03 15:05:32,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-03 15:05:32,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:32,799 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:32,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:05:32,799 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:32,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:32,800 INFO L85 PathProgramCache]: Analyzing trace with hash -438314141, now seen corresponding path program 1 times [2025-03-03 15:05:32,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:32,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365097362] [2025-03-03 15:05:32,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:32,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:32,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 15:05:32,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 15:05:32,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:32,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:32,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:32,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:32,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365097362] [2025-03-03 15:05:32,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365097362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:32,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:32,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:05:32,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442303950] [2025-03-03 15:05:32,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:32,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:05:32,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:32,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:05:32,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:05:32,889 INFO L87 Difference]: Start difference. First operand 4325 states and 6095 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:33,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:33,089 INFO L93 Difference]: Finished difference Result 9625 states and 13495 transitions. [2025-03-03 15:05:33,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:05:33,089 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-03-03 15:05:33,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:33,099 INFO L225 Difference]: With dead ends: 9625 [2025-03-03 15:05:33,100 INFO L226 Difference]: Without dead ends: 7395 [2025-03-03 15:05:33,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:05:33,104 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 991 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 991 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:33,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [991 Valid, 313 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:05:33,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7395 states. [2025-03-03 15:05:33,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7395 to 4345. [2025-03-03 15:05:33,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4345 states, 4344 states have (on average 1.408609576427256) internal successors, (6119), 4344 states have internal predecessors, (6119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:33,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4345 states to 4345 states and 6119 transitions. [2025-03-03 15:05:33,179 INFO L78 Accepts]: Start accepts. Automaton has 4345 states and 6119 transitions. Word has length 60 [2025-03-03 15:05:33,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:33,179 INFO L471 AbstractCegarLoop]: Abstraction has 4345 states and 6119 transitions. [2025-03-03 15:05:33,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:33,180 INFO L276 IsEmpty]: Start isEmpty. Operand 4345 states and 6119 transitions. [2025-03-03 15:05:33,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 15:05:33,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:33,182 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:33,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:05:33,182 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:33,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:33,183 INFO L85 PathProgramCache]: Analyzing trace with hash -18779967, now seen corresponding path program 1 times [2025-03-03 15:05:33,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:33,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568829416] [2025-03-03 15:05:33,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:33,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:33,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 15:05:33,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 15:05:33,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:33,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:33,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:33,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:33,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568829416] [2025-03-03 15:05:33,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568829416] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:33,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:33,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:05:33,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590103495] [2025-03-03 15:05:33,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:33,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:05:33,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:33,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:05:33,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:05:33,435 INFO L87 Difference]: Start difference. First operand 4345 states and 6119 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:33,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:33,881 INFO L93 Difference]: Finished difference Result 10232 states and 14480 transitions. [2025-03-03 15:05:33,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:05:33,881 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-03-03 15:05:33,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:33,891 INFO L225 Difference]: With dead ends: 10232 [2025-03-03 15:05:33,891 INFO L226 Difference]: Without dead ends: 6782 [2025-03-03 15:05:33,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-03-03 15:05:33,895 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 536 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:33,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 680 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:05:33,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6782 states. [2025-03-03 15:05:33,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6782 to 4261. [2025-03-03 15:05:33,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4261 states, 4260 states have (on average 1.4061032863849765) internal successors, (5990), 4260 states have internal predecessors, (5990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:33,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4261 states to 4261 states and 5990 transitions. [2025-03-03 15:05:33,966 INFO L78 Accepts]: Start accepts. Automaton has 4261 states and 5990 transitions. Word has length 62 [2025-03-03 15:05:33,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:33,967 INFO L471 AbstractCegarLoop]: Abstraction has 4261 states and 5990 transitions. [2025-03-03 15:05:33,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:33,967 INFO L276 IsEmpty]: Start isEmpty. Operand 4261 states and 5990 transitions. [2025-03-03 15:05:33,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 15:05:33,969 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:33,969 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:33,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:05:33,969 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:33,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:33,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1217517506, now seen corresponding path program 1 times [2025-03-03 15:05:33,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:33,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119280374] [2025-03-03 15:05:33,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:33,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:33,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 15:05:33,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 15:05:34,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:34,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:34,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:34,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:34,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119280374] [2025-03-03 15:05:34,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119280374] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:34,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:34,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:05:34,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952432403] [2025-03-03 15:05:34,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:34,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:05:34,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:34,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:05:34,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:05:34,236 INFO L87 Difference]: Start difference. First operand 4261 states and 5990 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:34,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:34,677 INFO L93 Difference]: Finished difference Result 11391 states and 16097 transitions. [2025-03-03 15:05:34,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:05:34,678 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-03-03 15:05:34,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:34,689 INFO L225 Difference]: With dead ends: 11391 [2025-03-03 15:05:34,689 INFO L226 Difference]: Without dead ends: 7812 [2025-03-03 15:05:34,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2025-03-03 15:05:34,694 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 1224 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1224 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:34,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1224 Valid, 675 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:05:34,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7812 states. [2025-03-03 15:05:34,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7812 to 4082. [2025-03-03 15:05:34,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4082 states, 4081 states have (on average 1.4035775545209508) internal successors, (5728), 4081 states have internal predecessors, (5728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:34,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4082 states to 4082 states and 5728 transitions. [2025-03-03 15:05:34,747 INFO L78 Accepts]: Start accepts. Automaton has 4082 states and 5728 transitions. Word has length 62 [2025-03-03 15:05:34,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:34,747 INFO L471 AbstractCegarLoop]: Abstraction has 4082 states and 5728 transitions. [2025-03-03 15:05:34,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:34,747 INFO L276 IsEmpty]: Start isEmpty. Operand 4082 states and 5728 transitions. [2025-03-03 15:05:34,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 15:05:34,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:34,749 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:34,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 15:05:34,749 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:34,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:34,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1694448131, now seen corresponding path program 1 times [2025-03-03 15:05:34,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:34,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237909026] [2025-03-03 15:05:34,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:34,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:34,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 15:05:34,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 15:05:34,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:34,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:34,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:34,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:34,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237909026] [2025-03-03 15:05:34,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237909026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:34,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:34,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:05:34,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526015490] [2025-03-03 15:05:34,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:34,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:05:34,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:34,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:05:34,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:05:34,950 INFO L87 Difference]: Start difference. First operand 4082 states and 5728 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:35,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:35,306 INFO L93 Difference]: Finished difference Result 10108 states and 14260 transitions. [2025-03-03 15:05:35,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:05:35,306 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-03-03 15:05:35,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:35,312 INFO L225 Difference]: With dead ends: 10108 [2025-03-03 15:05:35,313 INFO L226 Difference]: Without dead ends: 6585 [2025-03-03 15:05:35,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:05:35,316 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 1043 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1043 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:35,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1043 Valid, 672 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:05:35,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6585 states. [2025-03-03 15:05:35,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6585 to 4082. [2025-03-03 15:05:35,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4082 states, 4081 states have (on average 1.4021073266356285) internal successors, (5722), 4081 states have internal predecessors, (5722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:35,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4082 states to 4082 states and 5722 transitions. [2025-03-03 15:05:35,358 INFO L78 Accepts]: Start accepts. Automaton has 4082 states and 5722 transitions. Word has length 62 [2025-03-03 15:05:35,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:35,358 INFO L471 AbstractCegarLoop]: Abstraction has 4082 states and 5722 transitions. [2025-03-03 15:05:35,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:35,359 INFO L276 IsEmpty]: Start isEmpty. Operand 4082 states and 5722 transitions. [2025-03-03 15:05:35,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 15:05:35,360 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:35,360 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:35,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 15:05:35,360 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:35,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:35,361 INFO L85 PathProgramCache]: Analyzing trace with hash 336725420, now seen corresponding path program 1 times [2025-03-03 15:05:35,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:35,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939458551] [2025-03-03 15:05:35,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:35,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:35,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 15:05:35,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 15:05:35,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:35,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:35,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:35,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:35,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939458551] [2025-03-03 15:05:35,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939458551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:35,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:35,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:05:35,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470602678] [2025-03-03 15:05:35,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:35,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:05:35,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:35,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:05:35,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:05:35,404 INFO L87 Difference]: Start difference. First operand 4082 states and 5722 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:35,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:35,428 INFO L93 Difference]: Finished difference Result 5457 states and 7627 transitions. [2025-03-03 15:05:35,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:05:35,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-03 15:05:35,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:35,435 INFO L225 Difference]: With dead ends: 5457 [2025-03-03 15:05:35,435 INFO L226 Difference]: Without dead ends: 3955 [2025-03-03 15:05:35,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:05:35,438 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 148 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:35,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 477 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:05:35,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3955 states. [2025-03-03 15:05:35,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3955 to 3953. [2025-03-03 15:05:35,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3953 states, 3952 states have (on average 1.375253036437247) internal successors, (5435), 3952 states have internal predecessors, (5435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:35,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3953 states to 3953 states and 5435 transitions. [2025-03-03 15:05:35,475 INFO L78 Accepts]: Start accepts. Automaton has 3953 states and 5435 transitions. Word has length 63 [2025-03-03 15:05:35,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:35,476 INFO L471 AbstractCegarLoop]: Abstraction has 3953 states and 5435 transitions. [2025-03-03 15:05:35,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:35,476 INFO L276 IsEmpty]: Start isEmpty. Operand 3953 states and 5435 transitions. [2025-03-03 15:05:35,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 15:05:35,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:35,477 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:35,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 15:05:35,478 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:35,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:35,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1497312332, now seen corresponding path program 1 times [2025-03-03 15:05:35,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:35,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959522936] [2025-03-03 15:05:35,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:35,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:35,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 15:05:35,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 15:05:35,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:35,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:35,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:35,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:35,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959522936] [2025-03-03 15:05:35,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959522936] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:35,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:35,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:05:35,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822246454] [2025-03-03 15:05:35,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:35,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:05:35,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:35,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:05:35,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:05:35,523 INFO L87 Difference]: Start difference. First operand 3953 states and 5435 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:35,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:35,544 INFO L93 Difference]: Finished difference Result 5643 states and 7769 transitions. [2025-03-03 15:05:35,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:05:35,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-03 15:05:35,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:35,549 INFO L225 Difference]: With dead ends: 5643 [2025-03-03 15:05:35,549 INFO L226 Difference]: Without dead ends: 3536 [2025-03-03 15:05:35,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:05:35,552 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 130 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:35,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 476 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:05:35,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3536 states. [2025-03-03 15:05:35,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3536 to 3534. [2025-03-03 15:05:35,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3534 states, 3533 states have (on average 1.3555052363430513) internal successors, (4789), 3533 states have internal predecessors, (4789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:35,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3534 states to 3534 states and 4789 transitions. [2025-03-03 15:05:35,579 INFO L78 Accepts]: Start accepts. Automaton has 3534 states and 4789 transitions. Word has length 63 [2025-03-03 15:05:35,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:35,579 INFO L471 AbstractCegarLoop]: Abstraction has 3534 states and 4789 transitions. [2025-03-03 15:05:35,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:35,580 INFO L276 IsEmpty]: Start isEmpty. Operand 3534 states and 4789 transitions. [2025-03-03 15:05:35,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 15:05:35,582 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:35,582 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:35,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 15:05:35,582 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:35,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:35,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1233794324, now seen corresponding path program 1 times [2025-03-03 15:05:35,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:35,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967918354] [2025-03-03 15:05:35,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:35,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:35,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 15:05:35,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 15:05:35,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:35,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:35,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:35,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:35,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967918354] [2025-03-03 15:05:35,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967918354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:35,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:35,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:05:35,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988792067] [2025-03-03 15:05:35,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:35,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:05:35,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:35,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:05:35,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:05:35,629 INFO L87 Difference]: Start difference. First operand 3534 states and 4789 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:35,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:35,660 INFO L93 Difference]: Finished difference Result 4708 states and 6378 transitions. [2025-03-03 15:05:35,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:05:35,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-03 15:05:35,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:35,664 INFO L225 Difference]: With dead ends: 4708 [2025-03-03 15:05:35,664 INFO L226 Difference]: Without dead ends: 2783 [2025-03-03 15:05:35,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:05:35,666 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 118 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:35,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 463 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:05:35,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2783 states. [2025-03-03 15:05:35,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2783 to 2781. [2025-03-03 15:05:35,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2781 states, 2780 states have (on average 1.3273381294964028) internal successors, (3690), 2780 states have internal predecessors, (3690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:35,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2781 states to 2781 states and 3690 transitions. [2025-03-03 15:05:35,689 INFO L78 Accepts]: Start accepts. Automaton has 2781 states and 3690 transitions. Word has length 63 [2025-03-03 15:05:35,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:35,689 INFO L471 AbstractCegarLoop]: Abstraction has 2781 states and 3690 transitions. [2025-03-03 15:05:35,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:35,689 INFO L276 IsEmpty]: Start isEmpty. Operand 2781 states and 3690 transitions. [2025-03-03 15:05:35,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 15:05:35,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:35,691 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:35,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 15:05:35,691 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:35,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:35,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1683109917, now seen corresponding path program 1 times [2025-03-03 15:05:35,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:35,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263196831] [2025-03-03 15:05:35,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:35,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:35,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 15:05:35,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 15:05:35,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:35,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:35,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:35,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:35,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263196831] [2025-03-03 15:05:35,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263196831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:35,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:35,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:05:35,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080898281] [2025-03-03 15:05:35,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:35,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:05:35,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:35,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:05:35,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:05:35,729 INFO L87 Difference]: Start difference. First operand 2781 states and 3690 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:35,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:35,764 INFO L93 Difference]: Finished difference Result 5068 states and 6778 transitions. [2025-03-03 15:05:35,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:05:35,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-03 15:05:35,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:35,770 INFO L225 Difference]: With dead ends: 5068 [2025-03-03 15:05:35,771 INFO L226 Difference]: Without dead ends: 3664 [2025-03-03 15:05:35,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:05:35,773 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 156 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:35,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 335 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:05:35,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3664 states. [2025-03-03 15:05:35,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3664 to 2601. [2025-03-03 15:05:35,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2601 states, 2600 states have (on average 1.3276923076923077) internal successors, (3452), 2600 states have internal predecessors, (3452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:35,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2601 states to 2601 states and 3452 transitions. [2025-03-03 15:05:35,795 INFO L78 Accepts]: Start accepts. Automaton has 2601 states and 3452 transitions. Word has length 64 [2025-03-03 15:05:35,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:35,796 INFO L471 AbstractCegarLoop]: Abstraction has 2601 states and 3452 transitions. [2025-03-03 15:05:35,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:35,796 INFO L276 IsEmpty]: Start isEmpty. Operand 2601 states and 3452 transitions. [2025-03-03 15:05:35,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 15:05:35,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:35,798 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:35,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 15:05:35,798 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:35,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:35,798 INFO L85 PathProgramCache]: Analyzing trace with hash 90632299, now seen corresponding path program 1 times [2025-03-03 15:05:35,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:35,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105037730] [2025-03-03 15:05:35,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:35,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:35,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 15:05:35,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 15:05:35,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:35,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:36,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:36,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:36,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105037730] [2025-03-03 15:05:36,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105037730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:36,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:36,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:05:36,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055363509] [2025-03-03 15:05:36,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:36,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:05:36,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:36,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:05:36,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:05:36,330 INFO L87 Difference]: Start difference. First operand 2601 states and 3452 transitions. Second operand has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:36,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:36,908 INFO L93 Difference]: Finished difference Result 3967 states and 5303 transitions. [2025-03-03 15:05:36,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 15:05:36,908 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-03 15:05:36,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:36,913 INFO L225 Difference]: With dead ends: 3967 [2025-03-03 15:05:36,913 INFO L226 Difference]: Without dead ends: 3741 [2025-03-03 15:05:36,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-03-03 15:05:36,914 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 994 mSDsluCounter, 1586 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 994 SdHoareTripleChecker+Valid, 1788 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:36,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [994 Valid, 1788 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:05:36,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3741 states. [2025-03-03 15:05:36,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3741 to 2571. [2025-03-03 15:05:36,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2571 states, 2570 states have (on average 1.3268482490272373) internal successors, (3410), 2570 states have internal predecessors, (3410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:36,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2571 states to 2571 states and 3410 transitions. [2025-03-03 15:05:36,935 INFO L78 Accepts]: Start accepts. Automaton has 2571 states and 3410 transitions. Word has length 64 [2025-03-03 15:05:36,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:36,935 INFO L471 AbstractCegarLoop]: Abstraction has 2571 states and 3410 transitions. [2025-03-03 15:05:36,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:36,935 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 3410 transitions. [2025-03-03 15:05:36,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 15:05:36,936 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:36,936 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:36,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 15:05:36,937 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:36,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:36,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1330069578, now seen corresponding path program 1 times [2025-03-03 15:05:36,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:36,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919927606] [2025-03-03 15:05:36,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:36,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:36,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 15:05:36,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 15:05:36,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:36,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:37,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:37,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:37,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919927606] [2025-03-03 15:05:37,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919927606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:37,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:37,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-03 15:05:37,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412763953] [2025-03-03 15:05:37,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:37,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 15:05:37,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:37,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 15:05:37,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-03 15:05:37,520 INFO L87 Difference]: Start difference. First operand 2571 states and 3410 transitions. Second operand has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:38,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:38,277 INFO L93 Difference]: Finished difference Result 7105 states and 9550 transitions. [2025-03-03 15:05:38,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 15:05:38,278 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-03 15:05:38,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:38,289 INFO L225 Difference]: With dead ends: 7105 [2025-03-03 15:05:38,289 INFO L226 Difference]: Without dead ends: 6735 [2025-03-03 15:05:38,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=180, Invalid=576, Unknown=0, NotChecked=0, Total=756 [2025-03-03 15:05:38,294 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 1398 mSDsluCounter, 1717 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1398 SdHoareTripleChecker+Valid, 1956 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:38,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1398 Valid, 1956 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:05:38,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6735 states. [2025-03-03 15:05:38,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6735 to 2479. [2025-03-03 15:05:38,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2479 states, 2478 states have (on average 1.3276836158192091) internal successors, (3290), 2478 states have internal predecessors, (3290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:38,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2479 states to 2479 states and 3290 transitions. [2025-03-03 15:05:38,328 INFO L78 Accepts]: Start accepts. Automaton has 2479 states and 3290 transitions. Word has length 64 [2025-03-03 15:05:38,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:38,328 INFO L471 AbstractCegarLoop]: Abstraction has 2479 states and 3290 transitions. [2025-03-03 15:05:38,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:38,328 INFO L276 IsEmpty]: Start isEmpty. Operand 2479 states and 3290 transitions. [2025-03-03 15:05:38,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 15:05:38,329 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:38,329 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-03-03 15:05:38,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 15:05:38,330 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:38,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:38,330 INFO L85 PathProgramCache]: Analyzing trace with hash -232748629, now seen corresponding path program 1 times [2025-03-03 15:05:38,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:38,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482642464] [2025-03-03 15:05:38,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:38,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:38,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 15:05:38,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 15:05:38,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:38,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:38,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:38,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:38,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482642464] [2025-03-03 15:05:38,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482642464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:38,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:38,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:05:38,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196746005] [2025-03-03 15:05:38,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:38,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:05:38,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:38,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:05:38,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:05:38,417 INFO L87 Difference]: Start difference. First operand 2479 states and 3290 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 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-03-03 15:05:38,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:38,467 INFO L93 Difference]: Finished difference Result 2485 states and 3293 transitions. [2025-03-03 15:05:38,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:05:38,467 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 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-03-03 15:05:38,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:38,470 INFO L225 Difference]: With dead ends: 2485 [2025-03-03 15:05:38,470 INFO L226 Difference]: Without dead ends: 2267 [2025-03-03 15:05:38,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:05:38,471 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 698 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:38,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 483 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:05:38,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2267 states. [2025-03-03 15:05:38,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2267 to 2263. [2025-03-03 15:05:38,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2263 states, 2262 states have (on average 1.3315649867374004) internal successors, (3012), 2262 states have internal predecessors, (3012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:38,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2263 states to 2263 states and 3012 transitions. [2025-03-03 15:05:38,489 INFO L78 Accepts]: Start accepts. Automaton has 2263 states and 3012 transitions. Word has length 68 [2025-03-03 15:05:38,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:38,490 INFO L471 AbstractCegarLoop]: Abstraction has 2263 states and 3012 transitions. [2025-03-03 15:05:38,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 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-03-03 15:05:38,490 INFO L276 IsEmpty]: Start isEmpty. Operand 2263 states and 3012 transitions. [2025-03-03 15:05:38,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 15:05:38,492 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:38,492 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:38,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 15:05:38,492 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:38,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:38,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1489276504, now seen corresponding path program 1 times [2025-03-03 15:05:38,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:38,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882606147] [2025-03-03 15:05:38,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:38,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:38,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 15:05:38,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 15:05:38,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:38,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:38,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:38,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:38,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882606147] [2025-03-03 15:05:38,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882606147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:38,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:38,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:05:38,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110934181] [2025-03-03 15:05:38,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:38,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:05:38,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:38,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:05:38,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:05:38,569 INFO L87 Difference]: Start difference. First operand 2263 states and 3012 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 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-03-03 15:05:38,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:38,592 INFO L93 Difference]: Finished difference Result 5622 states and 7594 transitions. [2025-03-03 15:05:38,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:05:38,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 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-03-03 15:05:38,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:38,598 INFO L225 Difference]: With dead ends: 5622 [2025-03-03 15:05:38,598 INFO L226 Difference]: Without dead ends: 3865 [2025-03-03 15:05:38,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:05:38,601 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 99 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:38,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 402 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:05:38,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3865 states. [2025-03-03 15:05:38,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3865 to 3637. [2025-03-03 15:05:38,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3637 states, 3636 states have (on average 1.3380088008800881) internal successors, (4865), 3636 states have internal predecessors, (4865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:38,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3637 states to 3637 states and 4865 transitions. [2025-03-03 15:05:38,633 INFO L78 Accepts]: Start accepts. Automaton has 3637 states and 4865 transitions. Word has length 71 [2025-03-03 15:05:38,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:38,633 INFO L471 AbstractCegarLoop]: Abstraction has 3637 states and 4865 transitions. [2025-03-03 15:05:38,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 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-03-03 15:05:38,633 INFO L276 IsEmpty]: Start isEmpty. Operand 3637 states and 4865 transitions. [2025-03-03 15:05:38,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 15:05:38,635 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:38,635 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:38,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 15:05:38,635 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:38,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:38,635 INFO L85 PathProgramCache]: Analyzing trace with hash -2032180887, now seen corresponding path program 1 times [2025-03-03 15:05:38,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:38,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642761503] [2025-03-03 15:05:38,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:38,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:38,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 15:05:38,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 15:05:38,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:38,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:38,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:38,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:38,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642761503] [2025-03-03 15:05:38,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642761503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:38,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:38,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:05:38,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414356263] [2025-03-03 15:05:38,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:38,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:05:38,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:38,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:05:38,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:05:38,702 INFO L87 Difference]: Start difference. First operand 3637 states and 4865 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:38,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:38,728 INFO L93 Difference]: Finished difference Result 9589 states and 12915 transitions. [2025-03-03 15:05:38,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:05:38,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-03-03 15:05:38,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:38,735 INFO L225 Difference]: With dead ends: 9589 [2025-03-03 15:05:38,735 INFO L226 Difference]: Without dead ends: 6458 [2025-03-03 15:05:38,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:05:38,739 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 88 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:38,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 392 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:05:38,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6458 states. [2025-03-03 15:05:38,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6458 to 5924. [2025-03-03 15:05:38,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5924 states, 5923 states have (on average 1.3329393888232315) internal successors, (7895), 5923 states have internal predecessors, (7895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:38,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5924 states to 5924 states and 7895 transitions. [2025-03-03 15:05:38,789 INFO L78 Accepts]: Start accepts. Automaton has 5924 states and 7895 transitions. Word has length 72 [2025-03-03 15:05:38,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:38,790 INFO L471 AbstractCegarLoop]: Abstraction has 5924 states and 7895 transitions. [2025-03-03 15:05:38,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:38,790 INFO L276 IsEmpty]: Start isEmpty. Operand 5924 states and 7895 transitions. [2025-03-03 15:05:38,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 15:05:38,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:38,791 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:38,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 15:05:38,791 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:38,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:38,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1360652831, now seen corresponding path program 1 times [2025-03-03 15:05:38,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:38,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130362804] [2025-03-03 15:05:38,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:38,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:38,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 15:05:38,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 15:05:38,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:38,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:38,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:38,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:38,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130362804] [2025-03-03 15:05:38,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130362804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:38,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:38,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:05:38,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767727526] [2025-03-03 15:05:38,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:38,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:05:38,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:38,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:05:38,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:05:38,863 INFO L87 Difference]: Start difference. First operand 5924 states and 7895 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:38,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:38,897 INFO L93 Difference]: Finished difference Result 16050 states and 21375 transitions. [2025-03-03 15:05:38,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:05:38,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-03 15:05:38,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:38,910 INFO L225 Difference]: With dead ends: 16050 [2025-03-03 15:05:38,911 INFO L226 Difference]: Without dead ends: 10556 [2025-03-03 15:05:38,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:05:38,916 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 97 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:38,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 400 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:05:38,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10556 states. [2025-03-03 15:05:38,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10556 to 9762. [2025-03-03 15:05:38,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9762 states, 9761 states have (on average 1.320049175289417) internal successors, (12885), 9761 states have internal predecessors, (12885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:38,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9762 states to 9762 states and 12885 transitions. [2025-03-03 15:05:38,998 INFO L78 Accepts]: Start accepts. Automaton has 9762 states and 12885 transitions. Word has length 74 [2025-03-03 15:05:38,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:38,998 INFO L471 AbstractCegarLoop]: Abstraction has 9762 states and 12885 transitions. [2025-03-03 15:05:38,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:38,998 INFO L276 IsEmpty]: Start isEmpty. Operand 9762 states and 12885 transitions. [2025-03-03 15:05:38,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 15:05:38,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:38,999 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:38,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 15:05:38,999 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:39,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:39,000 INFO L85 PathProgramCache]: Analyzing trace with hash 876199424, now seen corresponding path program 1 times [2025-03-03 15:05:39,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:39,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162036118] [2025-03-03 15:05:39,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:39,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:39,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 15:05:39,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 15:05:39,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:39,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:39,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:39,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:39,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162036118] [2025-03-03 15:05:39,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162036118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:39,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:39,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:05:39,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125458277] [2025-03-03 15:05:39,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:39,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:05:39,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:39,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:05:39,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:05:39,130 INFO L87 Difference]: Start difference. First operand 9762 states and 12885 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:39,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:39,169 INFO L93 Difference]: Finished difference Result 10748 states and 14198 transitions. [2025-03-03 15:05:39,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:05:39,170 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-03-03 15:05:39,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:39,182 INFO L225 Difference]: With dead ends: 10748 [2025-03-03 15:05:39,182 INFO L226 Difference]: Without dead ends: 10746 [2025-03-03 15:05:39,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:05:39,186 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:39,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 879 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:05:39,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10746 states. [2025-03-03 15:05:39,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10746 to 10746. [2025-03-03 15:05:39,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10746 states, 10745 states have (on average 1.2907398790134947) internal successors, (13869), 10745 states have internal predecessors, (13869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:39,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10746 states to 10746 states and 13869 transitions. [2025-03-03 15:05:39,293 INFO L78 Accepts]: Start accepts. Automaton has 10746 states and 13869 transitions. Word has length 75 [2025-03-03 15:05:39,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:39,294 INFO L471 AbstractCegarLoop]: Abstraction has 10746 states and 13869 transitions. [2025-03-03 15:05:39,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:39,294 INFO L276 IsEmpty]: Start isEmpty. Operand 10746 states and 13869 transitions. [2025-03-03 15:05:39,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 15:05:39,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:39,295 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:39,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 15:05:39,295 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:39,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:39,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1540174715, now seen corresponding path program 1 times [2025-03-03 15:05:39,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:39,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066498920] [2025-03-03 15:05:39,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:39,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:39,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 15:05:39,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 15:05:39,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:39,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:39,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:39,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:39,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066498920] [2025-03-03 15:05:39,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066498920] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:39,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:39,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:05:39,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040862925] [2025-03-03 15:05:39,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:39,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:05:39,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:39,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:05:39,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:05:39,331 INFO L87 Difference]: Start difference. First operand 10746 states and 13869 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:39,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:39,374 INFO L93 Difference]: Finished difference Result 26134 states and 33563 transitions. [2025-03-03 15:05:39,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:05:39,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-03 15:05:39,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:39,396 INFO L225 Difference]: With dead ends: 26134 [2025-03-03 15:05:39,396 INFO L226 Difference]: Without dead ends: 15832 [2025-03-03 15:05:39,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:05:39,407 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 117 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:39,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 296 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:05:39,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15832 states. [2025-03-03 15:05:39,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15832 to 15830. [2025-03-03 15:05:39,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15830 states, 15829 states have (on average 1.2648303746288458) internal successors, (20021), 15829 states have internal predecessors, (20021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:39,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15830 states to 15830 states and 20021 transitions. [2025-03-03 15:05:39,547 INFO L78 Accepts]: Start accepts. Automaton has 15830 states and 20021 transitions. Word has length 76 [2025-03-03 15:05:39,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:39,547 INFO L471 AbstractCegarLoop]: Abstraction has 15830 states and 20021 transitions. [2025-03-03 15:05:39,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:39,547 INFO L276 IsEmpty]: Start isEmpty. Operand 15830 states and 20021 transitions. [2025-03-03 15:05:39,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 15:05:39,550 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:39,551 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:39,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-03 15:05:39,551 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:39,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:39,551 INFO L85 PathProgramCache]: Analyzing trace with hash 236155878, now seen corresponding path program 1 times [2025-03-03 15:05:39,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:39,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033606905] [2025-03-03 15:05:39,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:39,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:39,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 15:05:39,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 15:05:39,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:39,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:39,780 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:39,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:39,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033606905] [2025-03-03 15:05:39,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033606905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:05:39,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:05:39,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:05:39,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226495926] [2025-03-03 15:05:39,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:05:39,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:05:39,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:39,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:05:39,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:05:39,782 INFO L87 Difference]: Start difference. First operand 15830 states and 20021 transitions. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:40,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:05:40,266 INFO L93 Difference]: Finished difference Result 36523 states and 46009 transitions. [2025-03-03 15:05:40,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 15:05:40,266 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2025-03-03 15:05:40,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:05:40,308 INFO L225 Difference]: With dead ends: 36523 [2025-03-03 15:05:40,308 INFO L226 Difference]: Without dead ends: 28621 [2025-03-03 15:05:40,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2025-03-03 15:05:40,322 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 929 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 929 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:05:40,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [929 Valid, 694 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:05:40,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28621 states. [2025-03-03 15:05:40,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28621 to 24803. [2025-03-03 15:05:40,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24803 states, 24802 states have (on average 1.2640109668575115) internal successors, (31350), 24802 states have internal predecessors, (31350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:40,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24803 states to 24803 states and 31350 transitions. [2025-03-03 15:05:40,596 INFO L78 Accepts]: Start accepts. Automaton has 24803 states and 31350 transitions. Word has length 95 [2025-03-03 15:05:40,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:05:40,596 INFO L471 AbstractCegarLoop]: Abstraction has 24803 states and 31350 transitions. [2025-03-03 15:05:40,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:05:40,596 INFO L276 IsEmpty]: Start isEmpty. Operand 24803 states and 31350 transitions. [2025-03-03 15:05:40,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 15:05:40,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:05:40,601 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:05:40,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-03 15:05:40,601 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:05:40,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:05:40,602 INFO L85 PathProgramCache]: Analyzing trace with hash -139979638, now seen corresponding path program 1 times [2025-03-03 15:05:40,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:05:40,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877776970] [2025-03-03 15:05:40,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:40,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:05:40,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 15:05:40,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 15:05:40,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:40,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:40,816 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:40,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:05:40,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877776970] [2025-03-03 15:05:40,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877776970] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:05:40,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165234396] [2025-03-03 15:05:40,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:05:40,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:05:40,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:05:40,819 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:05:40,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 15:05:40,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 15:05:40,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 15:05:40,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:05:40,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:05:40,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-03 15:05:40,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:05:41,960 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:41,961 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:05:43,045 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:05:43,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165234396] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:05:43,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:05:43,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 13, 14] total 30 [2025-03-03 15:05:43,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083941338] [2025-03-03 15:05:43,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:05:43,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-03 15:05:43,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:05:43,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-03 15:05:43,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=748, Unknown=0, NotChecked=0, Total=870 [2025-03-03 15:05:43,047 INFO L87 Difference]: Start difference. First operand 24803 states and 31350 transitions. Second operand has 30 states, 30 states have (on average 9.033333333333333) internal successors, (271), 30 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:01,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:01,781 INFO L93 Difference]: Finished difference Result 177005 states and 222580 transitions. [2025-03-03 15:06:01,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 382 states. [2025-03-03 15:06:01,781 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 9.033333333333333) internal successors, (271), 30 states have internal predecessors, (271), 0 states have call successors, (0), 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 95 [2025-03-03 15:06:01,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:01,966 INFO L225 Difference]: With dead ends: 177005 [2025-03-03 15:06:01,966 INFO L226 Difference]: Without dead ends: 152681 [2025-03-03 15:06:02,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 571 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 406 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74533 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=15994, Invalid=150062, Unknown=0, NotChecked=0, Total=166056 [2025-03-03 15:06:02,018 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 7719 mSDsluCounter, 6384 mSDsCounter, 0 mSdLazyCounter, 6643 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7719 SdHoareTripleChecker+Valid, 6799 SdHoareTripleChecker+Invalid, 6836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 6643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:02,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7719 Valid, 6799 Invalid, 6836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 6643 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-03-03 15:06:02,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152681 states. [2025-03-03 15:06:02,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152681 to 46736. [2025-03-03 15:06:02,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46736 states, 46735 states have (on average 1.2659248956884561) internal successors, (59163), 46735 states have internal predecessors, (59163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:02,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46736 states to 46736 states and 59163 transitions. [2025-03-03 15:06:02,956 INFO L78 Accepts]: Start accepts. Automaton has 46736 states and 59163 transitions. Word has length 95 [2025-03-03 15:06:02,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:02,957 INFO L471 AbstractCegarLoop]: Abstraction has 46736 states and 59163 transitions. [2025-03-03 15:06:02,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 9.033333333333333) internal successors, (271), 30 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:02,957 INFO L276 IsEmpty]: Start isEmpty. Operand 46736 states and 59163 transitions. [2025-03-03 15:06:02,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-03 15:06:02,965 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:02,965 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:06:02,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 15:06:03,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:06:03,171 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:03,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:03,171 INFO L85 PathProgramCache]: Analyzing trace with hash -655917357, now seen corresponding path program 1 times [2025-03-03 15:06:03,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:03,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332150173] [2025-03-03 15:06:03,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:03,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:03,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 15:06:03,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 15:06:03,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:03,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:03,250 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:03,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:03,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332150173] [2025-03-03 15:06:03,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332150173] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:06:03,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921790949] [2025-03-03 15:06:03,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:03,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:06:03,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:06:03,252 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:06:03,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 15:06:03,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 15:06:03,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 15:06:03,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:03,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:03,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 15:06:03,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:06:03,574 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:03,574 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:06:03,690 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:03,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921790949] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:06:03,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:06:03,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2025-03-03 15:06:03,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836687584] [2025-03-03 15:06:03,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:06:03,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 15:06:03,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:03,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 15:06:03,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-03-03 15:06:03,692 INFO L87 Difference]: Start difference. First operand 46736 states and 59163 transitions. Second operand has 14 states, 14 states have (on average 19.928571428571427) internal successors, (279), 14 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:04,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:04,264 INFO L93 Difference]: Finished difference Result 94055 states and 119047 transitions. [2025-03-03 15:06:04,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:06:04,264 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 19.928571428571427) internal successors, (279), 14 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2025-03-03 15:06:04,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:04,317 INFO L225 Difference]: With dead ends: 94055 [2025-03-03 15:06:04,317 INFO L226 Difference]: Without dead ends: 47776 [2025-03-03 15:06:04,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 203 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:06:04,347 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 1518 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1518 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:04,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1518 Valid, 697 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:06:04,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47776 states. [2025-03-03 15:06:04,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47776 to 42734. [2025-03-03 15:06:04,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42734 states, 42733 states have (on average 1.2425291928954203) internal successors, (53097), 42733 states have internal predecessors, (53097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:04,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42734 states to 42734 states and 53097 transitions. [2025-03-03 15:06:04,726 INFO L78 Accepts]: Start accepts. Automaton has 42734 states and 53097 transitions. Word has length 105 [2025-03-03 15:06:04,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:04,726 INFO L471 AbstractCegarLoop]: Abstraction has 42734 states and 53097 transitions. [2025-03-03 15:06:04,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 19.928571428571427) internal successors, (279), 14 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:04,726 INFO L276 IsEmpty]: Start isEmpty. Operand 42734 states and 53097 transitions. [2025-03-03 15:06:04,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-03 15:06:04,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:04,734 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:06:04,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 15:06:04,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2025-03-03 15:06:04,934 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:04,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:04,935 INFO L85 PathProgramCache]: Analyzing trace with hash -627728236, now seen corresponding path program 1 times [2025-03-03 15:06:04,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:04,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472219955] [2025-03-03 15:06:04,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:04,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:04,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 15:06:04,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 15:06:04,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:04,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:04,978 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 15:06:04,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:04,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472219955] [2025-03-03 15:06:04,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472219955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:04,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:04,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:06:04,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773012364] [2025-03-03 15:06:04,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:04,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:06:04,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:04,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:06:04,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:06:04,979 INFO L87 Difference]: Start difference. First operand 42734 states and 53097 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:05,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:05,156 INFO L93 Difference]: Finished difference Result 83312 states and 103678 transitions. [2025-03-03 15:06:05,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:06:05,156 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 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 106 [2025-03-03 15:06:05,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:05,205 INFO L225 Difference]: With dead ends: 83312 [2025-03-03 15:06:05,205 INFO L226 Difference]: Without dead ends: 41077 [2025-03-03 15:06:05,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:06:05,234 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 129 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:05,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 142 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:06:05,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41077 states. [2025-03-03 15:06:05,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41077 to 40796. [2025-03-03 15:06:05,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40796 states, 40795 states have (on average 1.2299791641132491) internal successors, (50177), 40795 states have internal predecessors, (50177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:05,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40796 states to 40796 states and 50177 transitions. [2025-03-03 15:06:05,848 INFO L78 Accepts]: Start accepts. Automaton has 40796 states and 50177 transitions. Word has length 106 [2025-03-03 15:06:05,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:05,848 INFO L471 AbstractCegarLoop]: Abstraction has 40796 states and 50177 transitions. [2025-03-03 15:06:05,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:05,849 INFO L276 IsEmpty]: Start isEmpty. Operand 40796 states and 50177 transitions. [2025-03-03 15:06:05,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-03 15:06:05,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:05,858 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:06:05,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-03 15:06:05,859 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:05,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:05,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1927505673, now seen corresponding path program 1 times [2025-03-03 15:06:05,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:05,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128813682] [2025-03-03 15:06:05,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:05,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:05,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 15:06:05,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 15:06:05,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:05,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:05,942 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:05,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:05,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128813682] [2025-03-03 15:06:05,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128813682] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:06:05,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703116426] [2025-03-03 15:06:05,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:05,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:06:05,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:06:05,945 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:06:05,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 15:06:06,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 15:06:06,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 15:06:06,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:06,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:06,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 15:06:06,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:06:06,335 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:06,335 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:06:06,453 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:06,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703116426] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:06:06,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:06:06,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2025-03-03 15:06:06,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520683409] [2025-03-03 15:06:06,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:06:06,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 15:06:06,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:06,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 15:06:06,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-03-03 15:06:06,455 INFO L87 Difference]: Start difference. First operand 40796 states and 50177 transitions. Second operand has 14 states, 14 states have (on average 21.071428571428573) internal successors, (295), 14 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:06,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:06,925 INFO L93 Difference]: Finished difference Result 87715 states and 108033 transitions. [2025-03-03 15:06:06,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:06:06,926 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 21.071428571428573) internal successors, (295), 14 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2025-03-03 15:06:06,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:06,972 INFO L225 Difference]: With dead ends: 87715 [2025-03-03 15:06:06,972 INFO L226 Difference]: Without dead ends: 47418 [2025-03-03 15:06:06,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 207 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:06:06,998 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 1075 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1075 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:06,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1075 Valid, 624 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:06:07,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47418 states. [2025-03-03 15:06:07,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47418 to 42421. [2025-03-03 15:06:07,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42421 states, 42420 states have (on average 1.2140971239981142) internal successors, (51502), 42420 states have internal predecessors, (51502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:07,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42421 states to 42421 states and 51502 transitions. [2025-03-03 15:06:07,423 INFO L78 Accepts]: Start accepts. Automaton has 42421 states and 51502 transitions. Word has length 107 [2025-03-03 15:06:07,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:07,423 INFO L471 AbstractCegarLoop]: Abstraction has 42421 states and 51502 transitions. [2025-03-03 15:06:07,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 21.071428571428573) internal successors, (295), 14 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:07,424 INFO L276 IsEmpty]: Start isEmpty. Operand 42421 states and 51502 transitions. [2025-03-03 15:06:07,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-03 15:06:07,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:07,432 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:06:07,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 15:06:07,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:06:07,633 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:07,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:07,633 INFO L85 PathProgramCache]: Analyzing trace with hash -176676803, now seen corresponding path program 1 times [2025-03-03 15:06:07,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:07,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745150325] [2025-03-03 15:06:07,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:07,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:07,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 15:06:07,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 15:06:07,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:07,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:07,705 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:07,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:07,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745150325] [2025-03-03 15:06:07,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745150325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:07,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:07,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:06:07,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388343115] [2025-03-03 15:06:07,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:07,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:06:07,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:07,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:06:07,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:06:07,707 INFO L87 Difference]: Start difference. First operand 42421 states and 51502 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:07,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:07,936 INFO L93 Difference]: Finished difference Result 78799 states and 94904 transitions. [2025-03-03 15:06:07,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:06:07,936 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2025-03-03 15:06:07,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:07,983 INFO L225 Difference]: With dead ends: 78799 [2025-03-03 15:06:07,983 INFO L226 Difference]: Without dead ends: 47435 [2025-03-03 15:06:08,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:06:08,004 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 302 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:08,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 359 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:06:08,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47435 states. [2025-03-03 15:06:08,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47435 to 42478. [2025-03-03 15:06:08,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42478 states, 42477 states have (on average 1.2009322692280529) internal successors, (51012), 42477 states have internal predecessors, (51012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:08,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42478 states to 42478 states and 51012 transitions. [2025-03-03 15:06:08,364 INFO L78 Accepts]: Start accepts. Automaton has 42478 states and 51012 transitions. Word has length 107 [2025-03-03 15:06:08,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:08,364 INFO L471 AbstractCegarLoop]: Abstraction has 42478 states and 51012 transitions. [2025-03-03 15:06:08,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:08,364 INFO L276 IsEmpty]: Start isEmpty. Operand 42478 states and 51012 transitions. [2025-03-03 15:06:08,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 15:06:08,372 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:08,372 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:06:08,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-03 15:06:08,372 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:08,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:08,373 INFO L85 PathProgramCache]: Analyzing trace with hash -773747025, now seen corresponding path program 1 times [2025-03-03 15:06:08,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:08,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820176129] [2025-03-03 15:06:08,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:08,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:08,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 15:06:08,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 15:06:08,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:08,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:08,533 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:08,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:08,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820176129] [2025-03-03 15:06:08,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820176129] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:06:08,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571508211] [2025-03-03 15:06:08,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:08,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:06:08,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:06:08,535 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:06:08,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 15:06:08,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 15:06:08,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 15:06:08,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:08,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:08,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-03 15:06:08,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:06:09,327 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:09,327 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:06:09,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571508211] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:09,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:06:09,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [9] total 21 [2025-03-03 15:06:09,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528676388] [2025-03-03 15:06:09,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:09,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:06:09,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:09,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:06:09,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2025-03-03 15:06:09,328 INFO L87 Difference]: Start difference. First operand 42478 states and 51012 transitions. Second operand has 13 states, 13 states have (on average 8.461538461538462) internal successors, (110), 13 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:09,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:09,849 INFO L93 Difference]: Finished difference Result 77358 states and 92883 transitions. [2025-03-03 15:06:09,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 15:06:09,849 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.461538461538462) internal successors, (110), 13 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-03 15:06:09,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:09,900 INFO L225 Difference]: With dead ends: 77358 [2025-03-03 15:06:09,900 INFO L226 Difference]: Without dead ends: 46114 [2025-03-03 15:06:09,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=644, Unknown=0, NotChecked=0, Total=756 [2025-03-03 15:06:09,923 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 438 mSDsluCounter, 2013 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 2264 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:09,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 2264 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:06:09,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46114 states. [2025-03-03 15:06:10,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46114 to 45442. [2025-03-03 15:06:10,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45442 states, 45441 states have (on average 1.1965845822054972) internal successors, (54374), 45441 states have internal predecessors, (54374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:10,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45442 states to 45442 states and 54374 transitions. [2025-03-03 15:06:10,306 INFO L78 Accepts]: Start accepts. Automaton has 45442 states and 54374 transitions. Word has length 110 [2025-03-03 15:06:10,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:10,306 INFO L471 AbstractCegarLoop]: Abstraction has 45442 states and 54374 transitions. [2025-03-03 15:06:10,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.461538461538462) internal successors, (110), 13 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:10,306 INFO L276 IsEmpty]: Start isEmpty. Operand 45442 states and 54374 transitions. [2025-03-03 15:06:10,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 15:06:10,312 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:10,312 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:06:10,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 15:06:10,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:06:10,517 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:10,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:10,517 INFO L85 PathProgramCache]: Analyzing trace with hash -587079364, now seen corresponding path program 1 times [2025-03-03 15:06:10,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:10,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283904582] [2025-03-03 15:06:10,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:10,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:10,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 15:06:10,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 15:06:10,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:10,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:10,906 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:10,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:10,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283904582] [2025-03-03 15:06:10,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283904582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:10,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:10,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 15:06:10,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294954216] [2025-03-03 15:06:10,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:10,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:06:10,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:10,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:06:10,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:06:10,907 INFO L87 Difference]: Start difference. First operand 45442 states and 54374 transitions. Second operand has 12 states, 12 states have (on average 9.166666666666666) internal successors, (110), 12 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:11,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:11,487 INFO L93 Difference]: Finished difference Result 54037 states and 64525 transitions. [2025-03-03 15:06:11,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 15:06:11,487 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.166666666666666) internal successors, (110), 12 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-03 15:06:11,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:11,529 INFO L225 Difference]: With dead ends: 54037 [2025-03-03 15:06:11,529 INFO L226 Difference]: Without dead ends: 45300 [2025-03-03 15:06:11,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2025-03-03 15:06:11,541 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 952 mSDsluCounter, 1103 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 952 SdHoareTripleChecker+Valid, 1295 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:11,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [952 Valid, 1295 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:06:11,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45300 states. [2025-03-03 15:06:11,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45300 to 42944. [2025-03-03 15:06:11,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42944 states, 42943 states have (on average 1.193489043615956) internal successors, (51252), 42943 states have internal predecessors, (51252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:11,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42944 states to 42944 states and 51252 transitions. [2025-03-03 15:06:11,910 INFO L78 Accepts]: Start accepts. Automaton has 42944 states and 51252 transitions. Word has length 110 [2025-03-03 15:06:11,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:11,910 INFO L471 AbstractCegarLoop]: Abstraction has 42944 states and 51252 transitions. [2025-03-03 15:06:11,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.166666666666666) internal successors, (110), 12 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:11,910 INFO L276 IsEmpty]: Start isEmpty. Operand 42944 states and 51252 transitions. [2025-03-03 15:06:11,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 15:06:11,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:11,916 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:06:11,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-03 15:06:11,916 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:11,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:11,917 INFO L85 PathProgramCache]: Analyzing trace with hash -353350745, now seen corresponding path program 1 times [2025-03-03 15:06:11,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:11,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024267788] [2025-03-03 15:06:11,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:11,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:11,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 15:06:11,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 15:06:11,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:11,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:12,350 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:12,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:12,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024267788] [2025-03-03 15:06:12,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024267788] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:06:12,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534647495] [2025-03-03 15:06:12,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:12,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:06:12,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:06:12,353 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:06:12,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 15:06:12,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 15:06:12,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 15:06:12,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:12,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:12,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-03 15:06:12,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:06:13,194 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:13,194 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:06:13,718 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:13,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534647495] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:06:13,718 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:06:13,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 13] total 40 [2025-03-03 15:06:13,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177082428] [2025-03-03 15:06:13,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:06:13,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-03 15:06:13,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:13,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-03 15:06:13,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1439, Unknown=0, NotChecked=0, Total=1560 [2025-03-03 15:06:13,720 INFO L87 Difference]: Start difference. First operand 42944 states and 51252 transitions. Second operand has 40 states, 40 states have (on average 7.625) internal successors, (305), 40 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:21,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:21,980 INFO L93 Difference]: Finished difference Result 150925 states and 179304 transitions. [2025-03-03 15:06:21,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2025-03-03 15:06:21,980 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 7.625) internal successors, (305), 40 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-03 15:06:21,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:22,117 INFO L225 Difference]: With dead ends: 150925 [2025-03-03 15:06:22,117 INFO L226 Difference]: Without dead ends: 133360 [2025-03-03 15:06:22,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6987 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=3708, Invalid=19854, Unknown=0, NotChecked=0, Total=23562 [2025-03-03 15:06:22,165 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 3960 mSDsluCounter, 5336 mSDsCounter, 0 mSdLazyCounter, 5450 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3960 SdHoareTripleChecker+Valid, 5557 SdHoareTripleChecker+Invalid, 5516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 5450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:22,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3960 Valid, 5557 Invalid, 5516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 5450 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 15:06:22,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133360 states. [2025-03-03 15:06:22,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133360 to 56852. [2025-03-03 15:06:23,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56852 states, 56851 states have (on average 1.1927494679073367) internal successors, (67809), 56851 states have internal predecessors, (67809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:23,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56852 states to 56852 states and 67809 transitions. [2025-03-03 15:06:23,069 INFO L78 Accepts]: Start accepts. Automaton has 56852 states and 67809 transitions. Word has length 110 [2025-03-03 15:06:23,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:23,069 INFO L471 AbstractCegarLoop]: Abstraction has 56852 states and 67809 transitions. [2025-03-03 15:06:23,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 7.625) internal successors, (305), 40 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:23,069 INFO L276 IsEmpty]: Start isEmpty. Operand 56852 states and 67809 transitions. [2025-03-03 15:06:23,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 15:06:23,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:23,075 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:06:23,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 15:06:23,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-03-03 15:06:23,276 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:23,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:23,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1143250439, now seen corresponding path program 1 times [2025-03-03 15:06:23,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:23,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493247363] [2025-03-03 15:06:23,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:23,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:23,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 15:06:23,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 15:06:23,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:23,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:23,331 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:23,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:23,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493247363] [2025-03-03 15:06:23,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493247363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:23,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:23,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:06:23,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537336713] [2025-03-03 15:06:23,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:23,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:06:23,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:23,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:06:23,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:06:23,334 INFO L87 Difference]: Start difference. First operand 56852 states and 67809 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:23,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:23,498 INFO L93 Difference]: Finished difference Result 94711 states and 112754 transitions. [2025-03-03 15:06:23,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:06:23,498 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-03-03 15:06:23,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:23,537 INFO L225 Difference]: With dead ends: 94711 [2025-03-03 15:06:23,537 INFO L226 Difference]: Without dead ends: 38586 [2025-03-03 15:06:23,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:06:23,566 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 73 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:23,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 306 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:06:23,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38586 states. [2025-03-03 15:06:24,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38586 to 36898. [2025-03-03 15:06:24,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36898 states, 36897 states have (on average 1.170799794021194) internal successors, (43199), 36897 states have internal predecessors, (43199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:24,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36898 states to 36898 states and 43199 transitions. [2025-03-03 15:06:24,166 INFO L78 Accepts]: Start accepts. Automaton has 36898 states and 43199 transitions. Word has length 111 [2025-03-03 15:06:24,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:24,166 INFO L471 AbstractCegarLoop]: Abstraction has 36898 states and 43199 transitions. [2025-03-03 15:06:24,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:24,167 INFO L276 IsEmpty]: Start isEmpty. Operand 36898 states and 43199 transitions. [2025-03-03 15:06:24,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 15:06:24,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:24,171 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:06:24,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-03 15:06:24,172 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:24,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:24,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1079362072, now seen corresponding path program 1 times [2025-03-03 15:06:24,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:24,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670571209] [2025-03-03 15:06:24,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:24,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:24,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 15:06:24,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 15:06:24,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:24,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:24,430 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:24,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:24,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670571209] [2025-03-03 15:06:24,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670571209] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:06:24,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173347689] [2025-03-03 15:06:24,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:24,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:06:24,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:06:24,436 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:06:24,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 15:06:24,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 15:06:24,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 15:06:24,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:24,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:24,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-03 15:06:24,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:06:25,557 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:25,557 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:06:26,059 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:26,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173347689] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:06:26,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:06:26,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 14] total 31 [2025-03-03 15:06:26,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928493941] [2025-03-03 15:06:26,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:06:26,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-03 15:06:26,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:26,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-03 15:06:26,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=789, Unknown=0, NotChecked=0, Total=930 [2025-03-03 15:06:26,061 INFO L87 Difference]: Start difference. First operand 36898 states and 43199 transitions. Second operand has 31 states, 31 states have (on average 8.709677419354838) internal successors, (270), 31 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:27,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:27,546 INFO L93 Difference]: Finished difference Result 90381 states and 105867 transitions. [2025-03-03 15:06:27,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-03 15:06:27,546 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 8.709677419354838) internal successors, (270), 31 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-03-03 15:06:27,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:27,616 INFO L225 Difference]: With dead ends: 90381 [2025-03-03 15:06:27,616 INFO L226 Difference]: Without dead ends: 72389 [2025-03-03 15:06:27,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 624 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=626, Invalid=2344, Unknown=0, NotChecked=0, Total=2970 [2025-03-03 15:06:27,638 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 1914 mSDsluCounter, 3259 mSDsCounter, 0 mSdLazyCounter, 2447 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1914 SdHoareTripleChecker+Valid, 3457 SdHoareTripleChecker+Invalid, 2471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:27,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1914 Valid, 3457 Invalid, 2471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2447 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 15:06:27,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72389 states. [2025-03-03 15:06:28,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72389 to 36860. [2025-03-03 15:06:28,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36860 states, 36859 states have (on average 1.1704604031579804) internal successors, (43142), 36859 states have internal predecessors, (43142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:28,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36860 states to 36860 states and 43142 transitions. [2025-03-03 15:06:28,074 INFO L78 Accepts]: Start accepts. Automaton has 36860 states and 43142 transitions. Word has length 111 [2025-03-03 15:06:28,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:28,074 INFO L471 AbstractCegarLoop]: Abstraction has 36860 states and 43142 transitions. [2025-03-03 15:06:28,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 8.709677419354838) internal successors, (270), 31 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:28,075 INFO L276 IsEmpty]: Start isEmpty. Operand 36860 states and 43142 transitions. [2025-03-03 15:06:28,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 15:06:28,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:28,078 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:06:28,085 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 15:06:28,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-03-03 15:06:28,279 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:28,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:28,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1315964344, now seen corresponding path program 1 times [2025-03-03 15:06:28,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:28,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175974240] [2025-03-03 15:06:28,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:28,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:28,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 15:06:28,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 15:06:28,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:28,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:28,447 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:28,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:28,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175974240] [2025-03-03 15:06:28,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175974240] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:06:28,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969307171] [2025-03-03 15:06:28,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:28,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:06:28,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:06:28,450 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:06:28,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 15:06:28,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 15:06:28,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 15:06:28,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:28,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:28,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-03 15:06:28,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:06:29,695 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:29,695 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:06:30,315 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:30,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969307171] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:06:30,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:06:30,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 18, 16] total 40 [2025-03-03 15:06:30,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941750121] [2025-03-03 15:06:30,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:06:30,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-03 15:06:30,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:30,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-03 15:06:30,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1426, Unknown=0, NotChecked=0, Total=1560 [2025-03-03 15:06:30,316 INFO L87 Difference]: Start difference. First operand 36860 states and 43142 transitions. Second operand has 40 states, 40 states have (on average 7.85) internal successors, (314), 40 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:35,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:35,814 INFO L93 Difference]: Finished difference Result 107703 states and 126494 transitions. [2025-03-03 15:06:35,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2025-03-03 15:06:35,814 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 7.85) internal successors, (314), 40 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-03-03 15:06:35,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:35,914 INFO L225 Difference]: With dead ends: 107703 [2025-03-03 15:06:35,914 INFO L226 Difference]: Without dead ends: 94211 [2025-03-03 15:06:35,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9057 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3710, Invalid=24012, Unknown=0, NotChecked=0, Total=27722 [2025-03-03 15:06:35,947 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 4212 mSDsluCounter, 5121 mSDsCounter, 0 mSdLazyCounter, 5603 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4212 SdHoareTripleChecker+Valid, 5377 SdHoareTripleChecker+Invalid, 5683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 5603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:35,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4212 Valid, 5377 Invalid, 5683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 5603 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 15:06:36,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94211 states. [2025-03-03 15:06:36,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94211 to 35782. [2025-03-03 15:06:36,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35782 states, 35781 states have (on average 1.1690282552192504) internal successors, (41829), 35781 states have internal predecessors, (41829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:36,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35782 states to 35782 states and 41829 transitions. [2025-03-03 15:06:36,671 INFO L78 Accepts]: Start accepts. Automaton has 35782 states and 41829 transitions. Word has length 111 [2025-03-03 15:06:36,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:36,671 INFO L471 AbstractCegarLoop]: Abstraction has 35782 states and 41829 transitions. [2025-03-03 15:06:36,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 7.85) internal successors, (314), 40 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:36,671 INFO L276 IsEmpty]: Start isEmpty. Operand 35782 states and 41829 transitions. [2025-03-03 15:06:36,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 15:06:36,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:36,674 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:06:36,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 15:06:36,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:06:36,875 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:36,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:36,875 INFO L85 PathProgramCache]: Analyzing trace with hash -187806198, now seen corresponding path program 1 times [2025-03-03 15:06:36,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:36,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547987576] [2025-03-03 15:06:36,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:36,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:36,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:06:36,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:06:36,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:36,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:37,673 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:37,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:37,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547987576] [2025-03-03 15:06:37,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547987576] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:06:37,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989669119] [2025-03-03 15:06:37,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:37,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:06:37,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:06:37,675 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:06:37,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 15:06:37,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:06:37,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:06:37,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:37,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:37,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-03 15:06:37,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:06:38,320 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 15:06:38,321 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:06:38,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989669119] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:38,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:06:38,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [21] total 36 [2025-03-03 15:06:38,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584992590] [2025-03-03 15:06:38,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:38,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 15:06:38,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:38,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 15:06:38,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1159, Unknown=0, NotChecked=0, Total=1260 [2025-03-03 15:06:38,322 INFO L87 Difference]: Start difference. First operand 35782 states and 41829 transitions. Second operand has 17 states, 17 states have (on average 6.294117647058823) internal successors, (107), 17 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:38,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:38,880 INFO L93 Difference]: Finished difference Result 45066 states and 52719 transitions. [2025-03-03 15:06:38,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 15:06:38,881 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.294117647058823) internal successors, (107), 17 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-03-03 15:06:38,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:38,915 INFO L225 Difference]: With dead ends: 45066 [2025-03-03 15:06:38,915 INFO L226 Difference]: Without dead ends: 38592 [2025-03-03 15:06:38,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=306, Invalid=2046, Unknown=0, NotChecked=0, Total=2352 [2025-03-03 15:06:38,927 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 561 mSDsluCounter, 1333 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 1522 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:38,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 1522 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:06:38,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38592 states. [2025-03-03 15:06:39,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38592 to 33119. [2025-03-03 15:06:39,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33119 states, 33118 states have (on average 1.1688507760130442) internal successors, (38710), 33118 states have internal predecessors, (38710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:39,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33119 states to 33119 states and 38710 transitions. [2025-03-03 15:06:39,206 INFO L78 Accepts]: Start accepts. Automaton has 33119 states and 38710 transitions. Word has length 112 [2025-03-03 15:06:39,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:39,206 INFO L471 AbstractCegarLoop]: Abstraction has 33119 states and 38710 transitions. [2025-03-03 15:06:39,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.294117647058823) internal successors, (107), 17 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:39,206 INFO L276 IsEmpty]: Start isEmpty. Operand 33119 states and 38710 transitions. [2025-03-03 15:06:39,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-03 15:06:39,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:39,209 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:06:39,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-03 15:06:39,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2025-03-03 15:06:39,409 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:39,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:39,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1618611782, now seen corresponding path program 1 times [2025-03-03 15:06:39,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:39,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120832873] [2025-03-03 15:06:39,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:39,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:39,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 15:06:39,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 15:06:39,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:39,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:39,682 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:39,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:39,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120832873] [2025-03-03 15:06:39,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120832873] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:06:39,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208316565] [2025-03-03 15:06:39,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:39,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:06:39,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:06:39,685 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:06:39,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 15:06:39,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 15:06:39,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 15:06:39,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:39,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:39,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-03 15:06:39,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:06:41,730 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:41,730 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:06:43,335 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:43,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208316565] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:06:43,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:06:43,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 20, 19] total 47 [2025-03-03 15:06:43,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327009724] [2025-03-03 15:06:43,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:06:43,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-03-03 15:06:43,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:43,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-03-03 15:06:43,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=2015, Unknown=0, NotChecked=0, Total=2162 [2025-03-03 15:06:43,339 INFO L87 Difference]: Start difference. First operand 33119 states and 38710 transitions. Second operand has 47 states, 47 states have (on average 6.9361702127659575) internal successors, (326), 47 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)