./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.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 bb7f3b8fa32d5493bfca7086e69548af9d6372d67a054dd07846784fcdf24eca --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:35:37,550 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:35:37,602 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:35:37,607 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:35:37,608 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:35:37,624 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:35:37,625 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:35:37,625 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:35:37,625 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:35:37,625 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:35:37,625 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:35:37,625 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:35:37,626 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:35:37,626 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:35:37,626 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:35:37,626 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:35:37,626 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:35:37,626 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:35:37,626 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:35:37,626 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:35:37,626 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:35:37,626 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:35:37,626 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:35:37,626 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:35:37,626 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:35:37,627 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:35:37,627 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:35:37,627 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:35:37,627 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:35:37,627 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:35:37,627 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:35:37,627 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:35:37,627 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:35:37,627 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:35:37,627 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:35:37,627 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:35:37,627 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:35:37,628 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:35:37,628 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:35:37,628 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:35:37,628 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:35:37,628 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:35:37,628 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:35:37,628 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 -> bb7f3b8fa32d5493bfca7086e69548af9d6372d67a054dd07846784fcdf24eca [2025-03-16 19:35:37,842 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:35:37,847 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:35:37,851 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:35:37,852 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:35:37,852 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:35:37,853 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c [2025-03-16 19:35:38,939 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a79287603/af99b426867248a186ff2932f9b3746e/FLAGd6a39c42e [2025-03-16 19:35:39,229 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:35:39,229 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c [2025-03-16 19:35:39,241 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a79287603/af99b426867248a186ff2932f9b3746e/FLAGd6a39c42e [2025-03-16 19:35:39,516 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a79287603/af99b426867248a186ff2932f9b3746e [2025-03-16 19:35:39,518 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:35:39,519 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:35:39,520 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:35:39,520 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:35:39,522 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:35:39,523 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:35:39" (1/1) ... [2025-03-16 19:35:39,523 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ab071e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:35:39, skipping insertion in model container [2025-03-16 19:35:39,524 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:35:39" (1/1) ... [2025-03-16 19:35:39,551 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:35:39,729 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.6.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c[9241,9254] [2025-03-16 19:35:39,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:35:39,803 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:35:39,861 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.6.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c[9241,9254] [2025-03-16 19:35:39,891 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:35:39,909 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:35:39,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:35:39 WrapperNode [2025-03-16 19:35:39,910 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:35:39,911 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:35:39,911 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:35:39,911 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:35:39,915 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:35:39" (1/1) ... [2025-03-16 19:35:39,922 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:35:39" (1/1) ... [2025-03-16 19:35:39,957 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 809 [2025-03-16 19:35:39,958 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:35:39,958 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:35:39,958 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:35:39,958 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:35:39,964 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:35:39" (1/1) ... [2025-03-16 19:35:39,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:35:39" (1/1) ... [2025-03-16 19:35:39,967 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:35:39" (1/1) ... [2025-03-16 19:35:39,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-16 19:35:39,980 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:35:39" (1/1) ... [2025-03-16 19:35:39,980 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:35:39" (1/1) ... [2025-03-16 19:35:39,993 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:35:39" (1/1) ... [2025-03-16 19:35:39,995 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:35:39" (1/1) ... [2025-03-16 19:35:39,996 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:35:39" (1/1) ... [2025-03-16 19:35:40,001 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:35:39" (1/1) ... [2025-03-16 19:35:40,003 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:35:40,004 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:35:40,004 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:35:40,005 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:35:40,005 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:35:39" (1/1) ... [2025-03-16 19:35:40,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:35:40,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:35:40,035 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 19:35:40,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 19:35:40,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:35:40,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:35:40,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:35:40,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:35:40,146 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:35:40,147 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:35:40,678 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L515: havoc main_~node2__m2~2#1; [2025-03-16 19:35:40,678 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L499: 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_~node6__m6~1#1;havoc main_~node5__m5~1#1;havoc main_~node4__m4~1#1;havoc main_~node3__m3~1#1;havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1;havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1;havoc main_~node6____CPAchecker_TMP_0~0#1;havoc main_~node6__m6~0#1;havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-16 19:35:40,679 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L747: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-16 19:35:40,679 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L702: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-03-16 19:35:40,679 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L837: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-16 19:35:40,679 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L657: havoc main_~node5____CPAchecker_TMP_0~1#1; [2025-03-16 19:35:40,679 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L560: havoc main_~node5__m5~2#1; [2025-03-16 19:35:40,679 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L792: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-16 19:35:40,679 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L545: havoc main_~node4__m4~2#1; [2025-03-16 19:35:40,679 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L612: havoc main_~node6____CPAchecker_TMP_0~1#1;havoc main_~node6__m6~2#1; [2025-03-16 19:35:40,679 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L530: havoc main_~node3__m3~2#1; [2025-03-16 19:35:40,709 INFO L? ?]: Removed 99 outVars from TransFormulas that were not future-live. [2025-03-16 19:35:40,710 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:35:40,718 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:35:40,718 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:35:40,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:35:40 BoogieIcfgContainer [2025-03-16 19:35:40,718 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:35:40,720 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:35:40,720 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:35:40,723 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:35:40,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:35:39" (1/3) ... [2025-03-16 19:35:40,723 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fa8f912 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:35:40, skipping insertion in model container [2025-03-16 19:35:40,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:35:39" (2/3) ... [2025-03-16 19:35:40,723 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fa8f912 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:35:40, skipping insertion in model container [2025-03-16 19:35:40,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:35:40" (3/3) ... [2025-03-16 19:35:40,724 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c [2025-03-16 19:35:40,733 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:35:40,734 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.6.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c that has 1 procedures, 177 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-16 19:35:40,769 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:35:40,777 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;@1629eceb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:35:40,777 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:35:40,781 INFO L276 IsEmpty]: Start isEmpty. Operand has 177 states, 175 states have (on average 1.7657142857142858) internal successors, (309), 176 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:40,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-16 19:35:40,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:40,786 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:35:40,786 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:35:40,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:40,790 INFO L85 PathProgramCache]: Analyzing trace with hash 683207950, now seen corresponding path program 1 times [2025-03-16 19:35:40,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:40,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551356879] [2025-03-16 19:35:40,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:40,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:40,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-16 19:35:40,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-16 19:35:40,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:40,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:41,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:35:41,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:41,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551356879] [2025-03-16 19:35:41,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551356879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:41,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:41,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:35:41,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940238108] [2025-03-16 19:35:41,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:41,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:35:41,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:41,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:35:41,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:35:41,423 INFO L87 Difference]: Start difference. First operand has 177 states, 175 states have (on average 1.7657142857142858) internal successors, (309), 176 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:41,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:41,840 INFO L93 Difference]: Finished difference Result 1146 states and 1842 transitions. [2025-03-16 19:35:41,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:35:41,842 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-03-16 19:35:41,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:41,859 INFO L225 Difference]: With dead ends: 1146 [2025-03-16 19:35:41,859 INFO L226 Difference]: Without dead ends: 1036 [2025-03-16 19:35:41,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:35:41,868 INFO L435 NwaCegarLoop]: 924 mSDtfsCounter, 1804 mSDsluCounter, 4508 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1804 SdHoareTripleChecker+Valid, 5432 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:41,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1804 Valid, 5432 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:35:41,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2025-03-16 19:35:41,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 269. [2025-03-16 19:35:41,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 268 states have (on average 1.4514925373134329) internal successors, (389), 268 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:41,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 389 transitions. [2025-03-16 19:35:41,933 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 389 transitions. Word has length 90 [2025-03-16 19:35:41,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:41,934 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 389 transitions. [2025-03-16 19:35:41,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:41,935 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 389 transitions. [2025-03-16 19:35:41,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-16 19:35:41,938 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:41,938 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:35:41,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:35:41,940 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:35:41,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:41,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1736077166, now seen corresponding path program 1 times [2025-03-16 19:35:41,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:41,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472082039] [2025-03-16 19:35:41,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:41,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:41,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-16 19:35:41,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-16 19:35:41,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:41,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:42,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:35:42,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:42,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472082039] [2025-03-16 19:35:42,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472082039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:42,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:42,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:35:42,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903196421] [2025-03-16 19:35:42,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:42,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:35:42,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:42,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:35:42,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:35:42,201 INFO L87 Difference]: Start difference. First operand 269 states and 389 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:42,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:42,464 INFO L93 Difference]: Finished difference Result 1235 states and 1910 transitions. [2025-03-16 19:35:42,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:35:42,464 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2025-03-16 19:35:42,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:42,468 INFO L225 Difference]: With dead ends: 1235 [2025-03-16 19:35:42,468 INFO L226 Difference]: Without dead ends: 1095 [2025-03-16 19:35:42,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:35:42,469 INFO L435 NwaCegarLoop]: 884 mSDtfsCounter, 1239 mSDsluCounter, 2597 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1239 SdHoareTripleChecker+Valid, 3481 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:42,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1239 Valid, 3481 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:35:42,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2025-03-16 19:35:42,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 428. [2025-03-16 19:35:42,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 427 states have (on average 1.5011709601873535) internal successors, (641), 427 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:42,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 641 transitions. [2025-03-16 19:35:42,494 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 641 transitions. Word has length 92 [2025-03-16 19:35:42,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:42,494 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 641 transitions. [2025-03-16 19:35:42,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:42,495 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 641 transitions. [2025-03-16 19:35:42,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-16 19:35:42,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:42,496 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:35:42,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:35:42,496 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:35:42,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:42,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1838811274, now seen corresponding path program 1 times [2025-03-16 19:35:42,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:42,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945753219] [2025-03-16 19:35:42,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:42,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:42,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-16 19:35:42,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-16 19:35:42,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:42,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:42,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:35:42,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:42,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945753219] [2025-03-16 19:35:42,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945753219] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:42,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:42,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:35:42,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633315347] [2025-03-16 19:35:42,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:42,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:35:42,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:42,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:35:42,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:35:42,697 INFO L87 Difference]: Start difference. First operand 428 states and 641 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:42,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:42,911 INFO L93 Difference]: Finished difference Result 1394 states and 2162 transitions. [2025-03-16 19:35:42,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:35:42,911 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2025-03-16 19:35:42,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:42,917 INFO L225 Difference]: With dead ends: 1394 [2025-03-16 19:35:42,917 INFO L226 Difference]: Without dead ends: 1254 [2025-03-16 19:35:42,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:35:42,919 INFO L435 NwaCegarLoop]: 775 mSDtfsCounter, 1234 mSDsluCounter, 1751 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1234 SdHoareTripleChecker+Valid, 2526 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:42,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1234 Valid, 2526 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:35:42,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2025-03-16 19:35:42,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 656. [2025-03-16 19:35:42,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 655 states have (on average 1.5297709923664122) internal successors, (1002), 655 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:42,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1002 transitions. [2025-03-16 19:35:42,946 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1002 transitions. Word has length 92 [2025-03-16 19:35:42,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:42,946 INFO L471 AbstractCegarLoop]: Abstraction has 656 states and 1002 transitions. [2025-03-16 19:35:42,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:42,946 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1002 transitions. [2025-03-16 19:35:42,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-16 19:35:42,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:42,949 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:35:42,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:35:42,950 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:35:42,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:42,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1161909138, now seen corresponding path program 1 times [2025-03-16 19:35:42,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:42,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888963326] [2025-03-16 19:35:42,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:42,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:42,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-16 19:35:42,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-16 19:35:42,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:42,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:43,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:35:43,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:43,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888963326] [2025-03-16 19:35:43,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888963326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:43,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:43,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:35:43,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642633544] [2025-03-16 19:35:43,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:43,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:35:43,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:43,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:35:43,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:35:43,110 INFO L87 Difference]: Start difference. First operand 656 states and 1002 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:43,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:43,330 INFO L93 Difference]: Finished difference Result 1548 states and 2406 transitions. [2025-03-16 19:35:43,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:35:43,331 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2025-03-16 19:35:43,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:43,335 INFO L225 Difference]: With dead ends: 1548 [2025-03-16 19:35:43,335 INFO L226 Difference]: Without dead ends: 1408 [2025-03-16 19:35:43,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:35:43,336 INFO L435 NwaCegarLoop]: 666 mSDtfsCounter, 1337 mSDsluCounter, 1889 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1337 SdHoareTripleChecker+Valid, 2555 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:43,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1337 Valid, 2555 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:35:43,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2025-03-16 19:35:43,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 810. [2025-03-16 19:35:43,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 809 states have (on average 1.5401730531520395) internal successors, (1246), 809 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:43,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1246 transitions. [2025-03-16 19:35:43,359 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 1246 transitions. Word has length 92 [2025-03-16 19:35:43,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:43,359 INFO L471 AbstractCegarLoop]: Abstraction has 810 states and 1246 transitions. [2025-03-16 19:35:43,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:43,360 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1246 transitions. [2025-03-16 19:35:43,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-16 19:35:43,360 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:43,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:35:43,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:35:43,361 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:35:43,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:43,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1054005878, now seen corresponding path program 1 times [2025-03-16 19:35:43,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:43,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5791847] [2025-03-16 19:35:43,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:43,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:43,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-16 19:35:43,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-16 19:35:43,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:43,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:43,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:35:43,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:43,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5791847] [2025-03-16 19:35:43,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5791847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:43,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:43,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:35:43,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448284560] [2025-03-16 19:35:43,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:43,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:35:43,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:43,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:35:43,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:35:43,503 INFO L87 Difference]: Start difference. First operand 810 states and 1246 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:43,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:43,724 INFO L93 Difference]: Finished difference Result 1697 states and 2642 transitions. [2025-03-16 19:35:43,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:35:43,724 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2025-03-16 19:35:43,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:43,729 INFO L225 Difference]: With dead ends: 1697 [2025-03-16 19:35:43,729 INFO L226 Difference]: Without dead ends: 1557 [2025-03-16 19:35:43,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:35:43,730 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 1441 mSDsluCounter, 1817 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1441 SdHoareTripleChecker+Valid, 2374 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:43,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1441 Valid, 2374 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:35:43,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1557 states. [2025-03-16 19:35:43,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1557 to 959. [2025-03-16 19:35:43,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 959 states, 958 states have (on average 1.546972860125261) internal successors, (1482), 958 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:43,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1482 transitions. [2025-03-16 19:35:43,747 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1482 transitions. Word has length 92 [2025-03-16 19:35:43,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:43,748 INFO L471 AbstractCegarLoop]: Abstraction has 959 states and 1482 transitions. [2025-03-16 19:35:43,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:43,748 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1482 transitions. [2025-03-16 19:35:43,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-16 19:35:43,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:43,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:35:43,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:35:43,749 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:35:43,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:43,750 INFO L85 PathProgramCache]: Analyzing trace with hash 248206994, now seen corresponding path program 1 times [2025-03-16 19:35:43,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:43,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781735090] [2025-03-16 19:35:43,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:43,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:43,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-16 19:35:43,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-16 19:35:43,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:43,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:43,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:35:43,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:43,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781735090] [2025-03-16 19:35:43,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781735090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:43,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:43,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:35:43,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381842480] [2025-03-16 19:35:43,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:43,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:35:43,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:43,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:35:43,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:35:43,893 INFO L87 Difference]: Start difference. First operand 959 states and 1482 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:44,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:44,058 INFO L93 Difference]: Finished difference Result 1841 states and 2870 transitions. [2025-03-16 19:35:44,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:35:44,059 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2025-03-16 19:35:44,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:44,063 INFO L225 Difference]: With dead ends: 1841 [2025-03-16 19:35:44,063 INFO L226 Difference]: Without dead ends: 1701 [2025-03-16 19:35:44,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:35:44,064 INFO L435 NwaCegarLoop]: 448 mSDtfsCounter, 1546 mSDsluCounter, 1817 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1546 SdHoareTripleChecker+Valid, 2265 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:44,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1546 Valid, 2265 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:35:44,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1701 states. [2025-03-16 19:35:44,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1701 to 1103. [2025-03-16 19:35:44,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1103 states, 1102 states have (on average 1.5517241379310345) internal successors, (1710), 1102 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:44,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1710 transitions. [2025-03-16 19:35:44,096 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1710 transitions. Word has length 92 [2025-03-16 19:35:44,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:44,096 INFO L471 AbstractCegarLoop]: Abstraction has 1103 states and 1710 transitions. [2025-03-16 19:35:44,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:44,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1710 transitions. [2025-03-16 19:35:44,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-16 19:35:44,098 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:44,098 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:35:44,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:35:44,098 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:35:44,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:44,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1801846134, now seen corresponding path program 1 times [2025-03-16 19:35:44,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:44,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749391492] [2025-03-16 19:35:44,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:44,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:44,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-16 19:35:44,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-16 19:35:44,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:44,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:44,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:35:44,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:44,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749391492] [2025-03-16 19:35:44,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749391492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:44,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:44,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:35:44,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136441323] [2025-03-16 19:35:44,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:44,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:35:44,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:44,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:35:44,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:35:44,265 INFO L87 Difference]: Start difference. First operand 1103 states and 1710 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:44,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:44,438 INFO L93 Difference]: Finished difference Result 1980 states and 3090 transitions. [2025-03-16 19:35:44,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:35:44,438 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2025-03-16 19:35:44,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:44,443 INFO L225 Difference]: With dead ends: 1980 [2025-03-16 19:35:44,444 INFO L226 Difference]: Without dead ends: 1840 [2025-03-16 19:35:44,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:35:44,445 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 1642 mSDsluCounter, 2222 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1642 SdHoareTripleChecker+Valid, 2562 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:44,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1642 Valid, 2562 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:35:44,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1840 states. [2025-03-16 19:35:44,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1840 to 1242. [2025-03-16 19:35:44,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1242 states, 1241 states have (on average 1.5551974214343272) internal successors, (1930), 1241 states have internal predecessors, (1930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:44,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1242 states to 1242 states and 1930 transitions. [2025-03-16 19:35:44,472 INFO L78 Accepts]: Start accepts. Automaton has 1242 states and 1930 transitions. Word has length 92 [2025-03-16 19:35:44,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:44,472 INFO L471 AbstractCegarLoop]: Abstraction has 1242 states and 1930 transitions. [2025-03-16 19:35:44,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:44,472 INFO L276 IsEmpty]: Start isEmpty. Operand 1242 states and 1930 transitions. [2025-03-16 19:35:44,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-16 19:35:44,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:44,474 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:35:44,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:35:44,474 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:35:44,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:44,474 INFO L85 PathProgramCache]: Analyzing trace with hash -528124009, now seen corresponding path program 1 times [2025-03-16 19:35:44,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:44,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750243612] [2025-03-16 19:35:44,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:44,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:44,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-16 19:35:44,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-16 19:35:44,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:44,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:44,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:35:44,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:44,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750243612] [2025-03-16 19:35:44,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750243612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:44,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:44,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:35:44,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679454356] [2025-03-16 19:35:44,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:44,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:35:44,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:44,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:35:44,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:35:44,531 INFO L87 Difference]: Start difference. First operand 1242 states and 1930 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:44,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:44,556 INFO L93 Difference]: Finished difference Result 3219 states and 5047 transitions. [2025-03-16 19:35:44,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:35:44,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2025-03-16 19:35:44,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:44,562 INFO L225 Difference]: With dead ends: 3219 [2025-03-16 19:35:44,562 INFO L226 Difference]: Without dead ends: 2182 [2025-03-16 19:35:44,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:35:44,564 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 99 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:44,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 561 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:35:44,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2182 states. [2025-03-16 19:35:44,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2182 to 2180. [2025-03-16 19:35:44,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2180 states, 2179 states have (on average 1.5474988526847178) internal successors, (3372), 2179 states have internal predecessors, (3372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:44,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2180 states to 2180 states and 3372 transitions. [2025-03-16 19:35:44,597 INFO L78 Accepts]: Start accepts. Automaton has 2180 states and 3372 transitions. Word has length 92 [2025-03-16 19:35:44,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:44,597 INFO L471 AbstractCegarLoop]: Abstraction has 2180 states and 3372 transitions. [2025-03-16 19:35:44,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:44,597 INFO L276 IsEmpty]: Start isEmpty. Operand 2180 states and 3372 transitions. [2025-03-16 19:35:44,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-16 19:35:44,598 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:44,598 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:35:44,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:35:44,598 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:35:44,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:44,599 INFO L85 PathProgramCache]: Analyzing trace with hash -526962160, now seen corresponding path program 1 times [2025-03-16 19:35:44,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:44,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812401674] [2025-03-16 19:35:44,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:44,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:44,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-16 19:35:44,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-16 19:35:44,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:44,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:44,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-16 19:35:44,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:44,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812401674] [2025-03-16 19:35:44,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812401674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:44,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:44,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:35:44,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090930695] [2025-03-16 19:35:44,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:44,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:35:44,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:44,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:35:44,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:35:44,652 INFO L87 Difference]: Start difference. First operand 2180 states and 3372 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:44,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:44,693 INFO L93 Difference]: Finished difference Result 4157 states and 6459 transitions. [2025-03-16 19:35:44,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:35:44,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2025-03-16 19:35:44,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:44,699 INFO L225 Difference]: With dead ends: 4157 [2025-03-16 19:35:44,699 INFO L226 Difference]: Without dead ends: 2182 [2025-03-16 19:35:44,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:35:44,702 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 124 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:44,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 438 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:35:44,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2182 states. [2025-03-16 19:35:44,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2182 to 2180. [2025-03-16 19:35:44,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2180 states, 2179 states have (on average 1.5438274437815511) internal successors, (3364), 2179 states have internal predecessors, (3364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:44,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2180 states to 2180 states and 3364 transitions. [2025-03-16 19:35:44,733 INFO L78 Accepts]: Start accepts. Automaton has 2180 states and 3364 transitions. Word has length 92 [2025-03-16 19:35:44,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:44,733 INFO L471 AbstractCegarLoop]: Abstraction has 2180 states and 3364 transitions. [2025-03-16 19:35:44,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:44,734 INFO L276 IsEmpty]: Start isEmpty. Operand 2180 states and 3364 transitions. [2025-03-16 19:35:44,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-16 19:35:44,735 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:44,735 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:35:44,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:35:44,735 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:35:44,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:44,735 INFO L85 PathProgramCache]: Analyzing trace with hash 812798173, now seen corresponding path program 1 times [2025-03-16 19:35:44,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:44,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585430664] [2025-03-16 19:35:44,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:44,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:44,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-16 19:35:44,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-16 19:35:44,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:44,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:44,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:35:44,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:44,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585430664] [2025-03-16 19:35:44,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585430664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:44,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:44,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:35:44,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219588881] [2025-03-16 19:35:44,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:44,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:35:44,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:44,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:35:44,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:35:44,842 INFO L87 Difference]: Start difference. First operand 2180 states and 3364 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:44,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:44,977 INFO L93 Difference]: Finished difference Result 4314 states and 6681 transitions. [2025-03-16 19:35:44,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:35:44,978 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2025-03-16 19:35:44,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:44,983 INFO L225 Difference]: With dead ends: 4314 [2025-03-16 19:35:44,983 INFO L226 Difference]: Without dead ends: 2180 [2025-03-16 19:35:44,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:35:44,986 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 659 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:44,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 130 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:35:44,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2180 states. [2025-03-16 19:35:45,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2180 to 2180. [2025-03-16 19:35:45,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2180 states, 2179 states have (on average 1.5296007342817806) internal successors, (3333), 2179 states have internal predecessors, (3333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:45,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2180 states to 2180 states and 3333 transitions. [2025-03-16 19:35:45,020 INFO L78 Accepts]: Start accepts. Automaton has 2180 states and 3333 transitions. Word has length 93 [2025-03-16 19:35:45,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:45,020 INFO L471 AbstractCegarLoop]: Abstraction has 2180 states and 3333 transitions. [2025-03-16 19:35:45,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:45,020 INFO L276 IsEmpty]: Start isEmpty. Operand 2180 states and 3333 transitions. [2025-03-16 19:35:45,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-16 19:35:45,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:45,021 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:35:45,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:35:45,022 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:35:45,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:45,022 INFO L85 PathProgramCache]: Analyzing trace with hash 712511974, now seen corresponding path program 1 times [2025-03-16 19:35:45,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:45,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792573100] [2025-03-16 19:35:45,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:45,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:45,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-16 19:35:45,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-16 19:35:45,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:45,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:45,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:35:45,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:45,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792573100] [2025-03-16 19:35:45,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792573100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:45,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:45,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:35:45,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694444558] [2025-03-16 19:35:45,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:45,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:35:45,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:45,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:35:45,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:35:45,115 INFO L87 Difference]: Start difference. First operand 2180 states and 3333 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:45,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:45,239 INFO L93 Difference]: Finished difference Result 4302 states and 6605 transitions. [2025-03-16 19:35:45,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:35:45,239 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2025-03-16 19:35:45,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:45,245 INFO L225 Difference]: With dead ends: 4302 [2025-03-16 19:35:45,245 INFO L226 Difference]: Without dead ends: 2180 [2025-03-16 19:35:45,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:35:45,247 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 619 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:45,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [619 Valid, 154 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:35:45,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2180 states. [2025-03-16 19:35:45,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2180 to 2180. [2025-03-16 19:35:45,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2180 states, 2179 states have (on average 1.51537402478201) internal successors, (3302), 2179 states have internal predecessors, (3302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:45,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2180 states to 2180 states and 3302 transitions. [2025-03-16 19:35:45,280 INFO L78 Accepts]: Start accepts. Automaton has 2180 states and 3302 transitions. Word has length 94 [2025-03-16 19:35:45,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:45,281 INFO L471 AbstractCegarLoop]: Abstraction has 2180 states and 3302 transitions. [2025-03-16 19:35:45,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:45,281 INFO L276 IsEmpty]: Start isEmpty. Operand 2180 states and 3302 transitions. [2025-03-16 19:35:45,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-16 19:35:45,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:45,282 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:35:45,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:35:45,282 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:35:45,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:45,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1882371935, now seen corresponding path program 1 times [2025-03-16 19:35:45,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:45,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899743447] [2025-03-16 19:35:45,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:45,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:45,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-16 19:35:45,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-16 19:35:45,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:45,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:45,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:35:45,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:45,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899743447] [2025-03-16 19:35:45,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899743447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:45,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:45,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:35:45,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671588283] [2025-03-16 19:35:45,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:45,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:35:45,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:45,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:35:45,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:35:45,393 INFO L87 Difference]: Start difference. First operand 2180 states and 3302 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 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-16 19:35:45,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:45,501 INFO L93 Difference]: Finished difference Result 4298 states and 6539 transitions. [2025-03-16 19:35:45,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:35:45,501 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 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-16 19:35:45,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:45,506 INFO L225 Difference]: With dead ends: 4298 [2025-03-16 19:35:45,507 INFO L226 Difference]: Without dead ends: 2180 [2025-03-16 19:35:45,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:35:45,509 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 601 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:45,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [601 Valid, 162 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:35:45,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2180 states. [2025-03-16 19:35:45,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2180 to 2180. [2025-03-16 19:35:45,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2180 states, 2179 states have (on average 1.5011473152822397) internal successors, (3271), 2179 states have internal predecessors, (3271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:45,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2180 states to 2180 states and 3271 transitions. [2025-03-16 19:35:45,538 INFO L78 Accepts]: Start accepts. Automaton has 2180 states and 3271 transitions. Word has length 95 [2025-03-16 19:35:45,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:45,539 INFO L471 AbstractCegarLoop]: Abstraction has 2180 states and 3271 transitions. [2025-03-16 19:35:45,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 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-16 19:35:45,539 INFO L276 IsEmpty]: Start isEmpty. Operand 2180 states and 3271 transitions. [2025-03-16 19:35:45,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-16 19:35:45,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:45,540 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:35:45,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:35:45,540 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:35:45,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:45,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1310349218, now seen corresponding path program 1 times [2025-03-16 19:35:45,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:45,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148119576] [2025-03-16 19:35:45,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:45,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:45,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-16 19:35:45,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-16 19:35:45,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:45,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:45,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:35:45,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:45,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148119576] [2025-03-16 19:35:45,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148119576] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:45,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:45,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:35:45,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033926200] [2025-03-16 19:35:45,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:45,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:35:45,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:45,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:35:45,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:35:45,614 INFO L87 Difference]: Start difference. First operand 2180 states and 3271 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:45,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:45,720 INFO L93 Difference]: Finished difference Result 4310 states and 6491 transitions. [2025-03-16 19:35:45,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:35:45,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2025-03-16 19:35:45,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:45,726 INFO L225 Difference]: With dead ends: 4310 [2025-03-16 19:35:45,726 INFO L226 Difference]: Without dead ends: 2180 [2025-03-16 19:35:45,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:35:45,728 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 629 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:45,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [629 Valid, 138 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:35:45,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2180 states. [2025-03-16 19:35:45,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2180 to 2180. [2025-03-16 19:35:45,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2180 states, 2179 states have (on average 1.486920605782469) internal successors, (3240), 2179 states have internal predecessors, (3240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:45,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2180 states to 2180 states and 3240 transitions. [2025-03-16 19:35:45,757 INFO L78 Accepts]: Start accepts. Automaton has 2180 states and 3240 transitions. Word has length 96 [2025-03-16 19:35:45,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:45,758 INFO L471 AbstractCegarLoop]: Abstraction has 2180 states and 3240 transitions. [2025-03-16 19:35:45,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:45,758 INFO L276 IsEmpty]: Start isEmpty. Operand 2180 states and 3240 transitions. [2025-03-16 19:35:45,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 19:35:45,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:45,759 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:35:45,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:35:45,759 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:35:45,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:45,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1992314397, now seen corresponding path program 1 times [2025-03-16 19:35:45,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:45,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590376571] [2025-03-16 19:35:45,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:45,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:45,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 19:35:45,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 19:35:45,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:45,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:45,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:35:45,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:45,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590376571] [2025-03-16 19:35:45,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590376571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:45,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:45,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:35:45,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421396312] [2025-03-16 19:35:45,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:45,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:35:45,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:45,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:35:45,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:35:45,858 INFO L87 Difference]: Start difference. First operand 2180 states and 3240 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:45,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:45,975 INFO L93 Difference]: Finished difference Result 4306 states and 6425 transitions. [2025-03-16 19:35:45,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:35:45,976 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-16 19:35:45,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:45,983 INFO L225 Difference]: With dead ends: 4306 [2025-03-16 19:35:45,983 INFO L226 Difference]: Without dead ends: 2180 [2025-03-16 19:35:45,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:35:45,986 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 611 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:45,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [611 Valid, 146 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:35:45,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2180 states. [2025-03-16 19:35:46,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2180 to 2180. [2025-03-16 19:35:46,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2180 states, 2179 states have (on average 1.4726938962826985) internal successors, (3209), 2179 states have internal predecessors, (3209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:46,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2180 states to 2180 states and 3209 transitions. [2025-03-16 19:35:46,024 INFO L78 Accepts]: Start accepts. Automaton has 2180 states and 3209 transitions. Word has length 97 [2025-03-16 19:35:46,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:46,025 INFO L471 AbstractCegarLoop]: Abstraction has 2180 states and 3209 transitions. [2025-03-16 19:35:46,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:46,025 INFO L276 IsEmpty]: Start isEmpty. Operand 2180 states and 3209 transitions. [2025-03-16 19:35:46,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-16 19:35:46,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:46,026 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:35:46,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:35:46,026 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:35:46,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:46,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1629387102, now seen corresponding path program 1 times [2025-03-16 19:35:46,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:46,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66861141] [2025-03-16 19:35:46,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:46,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:46,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-16 19:35:46,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-16 19:35:46,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:46,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:46,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:35:46,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:46,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66861141] [2025-03-16 19:35:46,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66861141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:46,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:46,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:35:46,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145885079] [2025-03-16 19:35:46,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:46,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:35:46,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:46,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:35:46,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:35:46,114 INFO L87 Difference]: Start difference. First operand 2180 states and 3209 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:46,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:46,216 INFO L93 Difference]: Finished difference Result 4294 states and 6351 transitions. [2025-03-16 19:35:46,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:35:46,217 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2025-03-16 19:35:46,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:46,221 INFO L225 Difference]: With dead ends: 4294 [2025-03-16 19:35:46,221 INFO L226 Difference]: Without dead ends: 2180 [2025-03-16 19:35:46,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:35:46,224 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 569 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:46,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 170 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:35:46,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2180 states. [2025-03-16 19:35:46,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2180 to 2180. [2025-03-16 19:35:46,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2180 states, 2179 states have (on average 1.458467186782928) internal successors, (3178), 2179 states have internal predecessors, (3178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:46,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2180 states to 2180 states and 3178 transitions. [2025-03-16 19:35:46,248 INFO L78 Accepts]: Start accepts. Automaton has 2180 states and 3178 transitions. Word has length 98 [2025-03-16 19:35:46,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:46,249 INFO L471 AbstractCegarLoop]: Abstraction has 2180 states and 3178 transitions. [2025-03-16 19:35:46,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:46,249 INFO L276 IsEmpty]: Start isEmpty. Operand 2180 states and 3178 transitions. [2025-03-16 19:35:46,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 19:35:46,250 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:46,250 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:35:46,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:35:46,250 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:35:46,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:46,250 INFO L85 PathProgramCache]: Analyzing trace with hash -2025468503, now seen corresponding path program 1 times [2025-03-16 19:35:46,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:46,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354876930] [2025-03-16 19:35:46,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:46,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:46,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 19:35:46,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 19:35:46,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:46,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:46,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:35:46,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:46,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354876930] [2025-03-16 19:35:46,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354876930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:46,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:46,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:35:46,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254852790] [2025-03-16 19:35:46,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:46,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:35:46,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:46,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:35:46,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:35:46,520 INFO L87 Difference]: Start difference. First operand 2180 states and 3178 transitions. Second operand has 8 states, 8 states have (on average 12.375) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:46,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:46,819 INFO L93 Difference]: Finished difference Result 6234 states and 9132 transitions. [2025-03-16 19:35:46,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:35:46,819 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-03-16 19:35:46,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:46,830 INFO L225 Difference]: With dead ends: 6234 [2025-03-16 19:35:46,830 INFO L226 Difference]: Without dead ends: 4162 [2025-03-16 19:35:46,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-03-16 19:35:46,834 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 819 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 819 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:46,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [819 Valid, 545 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:35:46,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4162 states. [2025-03-16 19:35:46,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4162 to 2180. [2025-03-16 19:35:46,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2180 states, 2179 states have (on average 1.4580082606700322) internal successors, (3177), 2179 states have internal predecessors, (3177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:46,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2180 states to 2180 states and 3177 transitions. [2025-03-16 19:35:46,871 INFO L78 Accepts]: Start accepts. Automaton has 2180 states and 3177 transitions. Word has length 99 [2025-03-16 19:35:46,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:46,872 INFO L471 AbstractCegarLoop]: Abstraction has 2180 states and 3177 transitions. [2025-03-16 19:35:46,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:46,872 INFO L276 IsEmpty]: Start isEmpty. Operand 2180 states and 3177 transitions. [2025-03-16 19:35:46,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 19:35:46,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:46,873 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:35:46,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:35:46,873 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:35:46,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:46,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1603799102, now seen corresponding path program 1 times [2025-03-16 19:35:46,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:46,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080819820] [2025-03-16 19:35:46,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:46,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:46,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 19:35:46,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 19:35:46,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:46,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:47,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:35:47,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:47,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080819820] [2025-03-16 19:35:47,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080819820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:47,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:47,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:35:47,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556380733] [2025-03-16 19:35:47,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:47,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:35:47,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:47,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:35:47,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:35:47,130 INFO L87 Difference]: Start difference. First operand 2180 states and 3177 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:47,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:47,499 INFO L93 Difference]: Finished difference Result 6234 states and 9095 transitions. [2025-03-16 19:35:47,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:35:47,500 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2025-03-16 19:35:47,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:47,507 INFO L225 Difference]: With dead ends: 6234 [2025-03-16 19:35:47,508 INFO L226 Difference]: Without dead ends: 4252 [2025-03-16 19:35:47,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-03-16 19:35:47,511 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 906 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 906 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:47,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [906 Valid, 605 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:35:47,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4252 states. [2025-03-16 19:35:47,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4252 to 2180. [2025-03-16 19:35:47,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2180 states, 2179 states have (on average 1.4547957778797613) internal successors, (3170), 2179 states have internal predecessors, (3170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:47,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2180 states to 2180 states and 3170 transitions. [2025-03-16 19:35:47,550 INFO L78 Accepts]: Start accepts. Automaton has 2180 states and 3170 transitions. Word has length 100 [2025-03-16 19:35:47,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:47,550 INFO L471 AbstractCegarLoop]: Abstraction has 2180 states and 3170 transitions. [2025-03-16 19:35:47,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:47,551 INFO L276 IsEmpty]: Start isEmpty. Operand 2180 states and 3170 transitions. [2025-03-16 19:35:47,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 19:35:47,551 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:47,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:35:47,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:35:47,552 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:35:47,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:47,552 INFO L85 PathProgramCache]: Analyzing trace with hash -949489214, now seen corresponding path program 1 times [2025-03-16 19:35:47,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:47,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918751038] [2025-03-16 19:35:47,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:47,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:47,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 19:35:47,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 19:35:47,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:47,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:47,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:35:47,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:47,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918751038] [2025-03-16 19:35:47,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918751038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:47,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:47,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:35:47,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081431315] [2025-03-16 19:35:47,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:47,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:35:47,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:47,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:35:47,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:35:47,774 INFO L87 Difference]: Start difference. First operand 2180 states and 3170 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:48,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:48,202 INFO L93 Difference]: Finished difference Result 6379 states and 9308 transitions. [2025-03-16 19:35:48,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:35:48,203 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2025-03-16 19:35:48,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:48,208 INFO L225 Difference]: With dead ends: 6379 [2025-03-16 19:35:48,208 INFO L226 Difference]: Without dead ends: 4312 [2025-03-16 19:35:48,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-03-16 19:35:48,211 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 899 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 899 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:48,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [899 Valid, 721 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:35:48,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4312 states. [2025-03-16 19:35:48,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4312 to 2180. [2025-03-16 19:35:48,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2180 states, 2179 states have (on average 1.4538779256539698) internal successors, (3168), 2179 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:48,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2180 states to 2180 states and 3168 transitions. [2025-03-16 19:35:48,240 INFO L78 Accepts]: Start accepts. Automaton has 2180 states and 3168 transitions. Word has length 100 [2025-03-16 19:35:48,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:48,240 INFO L471 AbstractCegarLoop]: Abstraction has 2180 states and 3168 transitions. [2025-03-16 19:35:48,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:48,240 INFO L276 IsEmpty]: Start isEmpty. Operand 2180 states and 3168 transitions. [2025-03-16 19:35:48,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 19:35:48,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:48,241 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:35:48,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:35:48,241 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:35:48,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:48,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1175427424, now seen corresponding path program 1 times [2025-03-16 19:35:48,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:48,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376345393] [2025-03-16 19:35:48,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:48,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:48,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 19:35:48,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 19:35:48,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:48,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:48,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:35:48,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:48,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376345393] [2025-03-16 19:35:48,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376345393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:48,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:48,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:35:48,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572635300] [2025-03-16 19:35:48,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:48,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:35:48,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:48,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:35:48,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:35:48,482 INFO L87 Difference]: Start difference. First operand 2180 states and 3168 transitions. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:48,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:48,854 INFO L93 Difference]: Finished difference Result 6334 states and 9234 transitions. [2025-03-16 19:35:48,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:35:48,855 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2025-03-16 19:35:48,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:48,861 INFO L225 Difference]: With dead ends: 6334 [2025-03-16 19:35:48,861 INFO L226 Difference]: Without dead ends: 4297 [2025-03-16 19:35:48,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-03-16 19:35:48,864 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 944 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 944 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:48,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [944 Valid, 603 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:35:48,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4297 states. [2025-03-16 19:35:48,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4297 to 2180. [2025-03-16 19:35:48,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2180 states, 2179 states have (on average 1.4515832950894907) internal successors, (3163), 2179 states have internal predecessors, (3163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:48,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2180 states to 2180 states and 3163 transitions. [2025-03-16 19:35:48,891 INFO L78 Accepts]: Start accepts. Automaton has 2180 states and 3163 transitions. Word has length 101 [2025-03-16 19:35:48,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:48,892 INFO L471 AbstractCegarLoop]: Abstraction has 2180 states and 3163 transitions. [2025-03-16 19:35:48,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:48,892 INFO L276 IsEmpty]: Start isEmpty. Operand 2180 states and 3163 transitions. [2025-03-16 19:35:48,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-16 19:35:48,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:48,893 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:35:48,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 19:35:48,893 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:35:48,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:48,893 INFO L85 PathProgramCache]: Analyzing trace with hash -330271102, now seen corresponding path program 1 times [2025-03-16 19:35:48,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:48,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015687130] [2025-03-16 19:35:48,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:48,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:48,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-16 19:35:48,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-16 19:35:48,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:48,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:49,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:35:49,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:49,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015687130] [2025-03-16 19:35:49,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015687130] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:49,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:49,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:35:49,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87135332] [2025-03-16 19:35:49,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:49,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:35:49,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:49,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:35:49,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:35:49,108 INFO L87 Difference]: Start difference. First operand 2180 states and 3163 transitions. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:49,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:49,555 INFO L93 Difference]: Finished difference Result 6364 states and 9269 transitions. [2025-03-16 19:35:49,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:35:49,556 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2025-03-16 19:35:49,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:49,561 INFO L225 Difference]: With dead ends: 6364 [2025-03-16 19:35:49,561 INFO L226 Difference]: Without dead ends: 4307 [2025-03-16 19:35:49,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-03-16 19:35:49,563 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 473 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:49,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 960 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:35:49,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4307 states. [2025-03-16 19:35:49,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4307 to 2180. [2025-03-16 19:35:49,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2180 states, 2179 states have (on average 1.4497475906379074) internal successors, (3159), 2179 states have internal predecessors, (3159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:49,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2180 states to 2180 states and 3159 transitions. [2025-03-16 19:35:49,593 INFO L78 Accepts]: Start accepts. Automaton has 2180 states and 3159 transitions. Word has length 102 [2025-03-16 19:35:49,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:49,593 INFO L471 AbstractCegarLoop]: Abstraction has 2180 states and 3159 transitions. [2025-03-16 19:35:49,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:49,593 INFO L276 IsEmpty]: Start isEmpty. Operand 2180 states and 3159 transitions. [2025-03-16 19:35:49,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-16 19:35:49,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:49,594 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:35:49,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 19:35:49,594 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:35:49,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:49,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1268908936, now seen corresponding path program 1 times [2025-03-16 19:35:49,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:49,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071921513] [2025-03-16 19:35:49,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:49,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:49,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-16 19:35:49,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-16 19:35:49,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:49,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:50,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:35:50,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:50,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071921513] [2025-03-16 19:35:50,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071921513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:50,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:50,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 19:35:50,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483651726] [2025-03-16 19:35:50,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:50,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 19:35:50,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:50,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 19:35:50,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:35:50,064 INFO L87 Difference]: Start difference. First operand 2180 states and 3159 transitions. Second operand has 12 states, 12 states have (on average 8.583333333333334) internal successors, (103), 11 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-16 19:35:51,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:51,048 INFO L93 Difference]: Finished difference Result 12582 states and 18253 transitions. [2025-03-16 19:35:51,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-16 19:35:51,049 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.583333333333334) internal successors, (103), 11 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 103 [2025-03-16 19:35:51,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:51,066 INFO L225 Difference]: With dead ends: 12582 [2025-03-16 19:35:51,066 INFO L226 Difference]: Without dead ends: 10570 [2025-03-16 19:35:51,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=197, Invalid=559, Unknown=0, NotChecked=0, Total=756 [2025-03-16 19:35:51,072 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 1755 mSDsluCounter, 1103 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1755 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 1213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:51,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1755 Valid, 1302 Invalid, 1213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 19:35:51,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10570 states. [2025-03-16 19:35:51,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10570 to 2195. [2025-03-16 19:35:51,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2195 states, 2194 states have (on average 1.4462169553327255) internal successors, (3173), 2194 states have internal predecessors, (3173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:51,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2195 states to 2195 states and 3173 transitions. [2025-03-16 19:35:51,138 INFO L78 Accepts]: Start accepts. Automaton has 2195 states and 3173 transitions. Word has length 103 [2025-03-16 19:35:51,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:51,138 INFO L471 AbstractCegarLoop]: Abstraction has 2195 states and 3173 transitions. [2025-03-16 19:35:51,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.583333333333334) internal successors, (103), 11 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-16 19:35:51,138 INFO L276 IsEmpty]: Start isEmpty. Operand 2195 states and 3173 transitions. [2025-03-16 19:35:51,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-16 19:35:51,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:51,139 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:35:51,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 19:35:51,140 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:35:51,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:51,140 INFO L85 PathProgramCache]: Analyzing trace with hash 763005842, now seen corresponding path program 1 times [2025-03-16 19:35:51,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:51,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59442644] [2025-03-16 19:35:51,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:51,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:51,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-16 19:35:51,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-16 19:35:51,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:51,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:51,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:35:51,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:51,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59442644] [2025-03-16 19:35:51,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59442644] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:51,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:51,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 19:35:51,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733195681] [2025-03-16 19:35:51,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:51,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 19:35:51,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:51,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 19:35:51,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:35:51,691 INFO L87 Difference]: Start difference. First operand 2195 states and 3173 transitions. Second operand has 12 states, 12 states have (on average 8.666666666666666) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:52,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:52,236 INFO L93 Difference]: Finished difference Result 8788 states and 12829 transitions. [2025-03-16 19:35:52,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:35:52,236 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.666666666666666) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2025-03-16 19:35:52,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:52,252 INFO L225 Difference]: With dead ends: 8788 [2025-03-16 19:35:52,252 INFO L226 Difference]: Without dead ends: 8207 [2025-03-16 19:35:52,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2025-03-16 19:35:52,258 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 1026 mSDsluCounter, 1477 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1026 SdHoareTripleChecker+Valid, 1807 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:52,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1026 Valid, 1807 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:35:52,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8207 states. [2025-03-16 19:35:52,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8207 to 2161. [2025-03-16 19:35:52,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2161 states, 2160 states have (on average 1.4467592592592593) internal successors, (3125), 2160 states have internal predecessors, (3125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:52,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2161 states to 2161 states and 3125 transitions. [2025-03-16 19:35:52,320 INFO L78 Accepts]: Start accepts. Automaton has 2161 states and 3125 transitions. Word has length 104 [2025-03-16 19:35:52,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:52,320 INFO L471 AbstractCegarLoop]: Abstraction has 2161 states and 3125 transitions. [2025-03-16 19:35:52,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.666666666666666) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:52,320 INFO L276 IsEmpty]: Start isEmpty. Operand 2161 states and 3125 transitions. [2025-03-16 19:35:52,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-16 19:35:52,321 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:52,321 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:35:52,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 19:35:52,322 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:35:52,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:52,322 INFO L85 PathProgramCache]: Analyzing trace with hash -977614094, now seen corresponding path program 1 times [2025-03-16 19:35:52,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:52,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482522661] [2025-03-16 19:35:52,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:52,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:52,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-16 19:35:52,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-16 19:35:52,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:52,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:54,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:35:54,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:54,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482522661] [2025-03-16 19:35:54,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482522661] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:54,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:54,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2025-03-16 19:35:54,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683139537] [2025-03-16 19:35:54,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:54,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-16 19:35:54,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:54,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-16 19:35:54,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=800, Unknown=0, NotChecked=0, Total=870 [2025-03-16 19:35:54,452 INFO L87 Difference]: Start difference. First operand 2161 states and 3125 transitions. Second operand has 30 states, 30 states have (on average 3.466666666666667) internal successors, (104), 29 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:58,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:58,413 INFO L93 Difference]: Finished difference Result 10877 states and 15882 transitions. [2025-03-16 19:35:58,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-16 19:35:58,413 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.466666666666667) internal successors, (104), 29 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2025-03-16 19:35:58,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:58,429 INFO L225 Difference]: With dead ends: 10877 [2025-03-16 19:35:58,430 INFO L226 Difference]: Without dead ends: 10347 [2025-03-16 19:35:58,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=412, Invalid=2450, Unknown=0, NotChecked=0, Total=2862 [2025-03-16 19:35:58,435 INFO L435 NwaCegarLoop]: 524 mSDtfsCounter, 1873 mSDsluCounter, 8873 mSDsCounter, 0 mSdLazyCounter, 4642 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1873 SdHoareTripleChecker+Valid, 9397 SdHoareTripleChecker+Invalid, 4643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:58,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1873 Valid, 9397 Invalid, 4643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4642 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-16 19:35:58,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10347 states. [2025-03-16 19:35:58,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10347 to 2231. [2025-03-16 19:35:58,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2231 states, 2230 states have (on average 1.4426008968609865) internal successors, (3217), 2230 states have internal predecessors, (3217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:58,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2231 states to 2231 states and 3217 transitions. [2025-03-16 19:35:58,503 INFO L78 Accepts]: Start accepts. Automaton has 2231 states and 3217 transitions. Word has length 104 [2025-03-16 19:35:58,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:58,503 INFO L471 AbstractCegarLoop]: Abstraction has 2231 states and 3217 transitions. [2025-03-16 19:35:58,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.466666666666667) internal successors, (104), 29 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:58,503 INFO L276 IsEmpty]: Start isEmpty. Operand 2231 states and 3217 transitions. [2025-03-16 19:35:58,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-16 19:35:58,504 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:58,504 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:35:58,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 19:35:58,504 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:35:58,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:58,505 INFO L85 PathProgramCache]: Analyzing trace with hash 995660274, now seen corresponding path program 1 times [2025-03-16 19:35:58,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:58,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567657318] [2025-03-16 19:35:58,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:58,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:58,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-16 19:35:58,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-16 19:35:58,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:58,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:58,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:35:58,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:58,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567657318] [2025-03-16 19:35:58,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567657318] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:58,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:58,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 19:35:58,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480562533] [2025-03-16 19:35:58,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:58,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 19:35:58,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:58,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 19:35:58,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:35:58,959 INFO L87 Difference]: Start difference. First operand 2231 states and 3217 transitions. Second operand has 13 states, 13 states have (on average 8.0) internal successors, (104), 12 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:59,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:59,457 INFO L93 Difference]: Finished difference Result 4801 states and 6980 transitions. [2025-03-16 19:35:59,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 19:35:59,458 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.0) internal successors, (104), 12 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2025-03-16 19:35:59,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:59,463 INFO L225 Difference]: With dead ends: 4801 [2025-03-16 19:35:59,463 INFO L226 Difference]: Without dead ends: 4231 [2025-03-16 19:35:59,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-03-16 19:35:59,465 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 989 mSDsluCounter, 1583 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 989 SdHoareTripleChecker+Valid, 1794 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:59,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [989 Valid, 1794 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:35:59,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4231 states. [2025-03-16 19:35:59,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4231 to 2205. [2025-03-16 19:35:59,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2205 states, 2204 states have (on average 1.441016333938294) internal successors, (3176), 2204 states have internal predecessors, (3176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:59,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2205 states to 2205 states and 3176 transitions. [2025-03-16 19:35:59,493 INFO L78 Accepts]: Start accepts. Automaton has 2205 states and 3176 transitions. Word has length 104 [2025-03-16 19:35:59,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:59,494 INFO L471 AbstractCegarLoop]: Abstraction has 2205 states and 3176 transitions. [2025-03-16 19:35:59,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.0) internal successors, (104), 12 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:59,494 INFO L276 IsEmpty]: Start isEmpty. Operand 2205 states and 3176 transitions. [2025-03-16 19:35:59,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-16 19:35:59,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:59,495 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:35:59,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 19:35:59,495 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:35:59,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:59,495 INFO L85 PathProgramCache]: Analyzing trace with hash -818402278, now seen corresponding path program 1 times [2025-03-16 19:35:59,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:59,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960238463] [2025-03-16 19:35:59,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:59,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:59,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-16 19:35:59,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-16 19:35:59,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:59,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:01,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:36:01,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:01,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960238463] [2025-03-16 19:36:01,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960238463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:01,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:01,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2025-03-16 19:36:01,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910118302] [2025-03-16 19:36:01,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:01,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-16 19:36:01,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:01,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-16 19:36:01,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1254, Unknown=0, NotChecked=0, Total=1332 [2025-03-16 19:36:01,393 INFO L87 Difference]: Start difference. First operand 2205 states and 3176 transitions. Second operand has 37 states, 37 states have (on average 2.810810810810811) internal successors, (104), 37 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:07,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:07,889 INFO L93 Difference]: Finished difference Result 16328 states and 23859 transitions. [2025-03-16 19:36:07,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-16 19:36:07,889 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.810810810810811) internal successors, (104), 37 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2025-03-16 19:36:07,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:07,906 INFO L225 Difference]: With dead ends: 16328 [2025-03-16 19:36:07,907 INFO L226 Difference]: Without dead ends: 14349 [2025-03-16 19:36:07,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=606, Invalid=4086, Unknown=0, NotChecked=0, Total=4692 [2025-03-16 19:36:07,913 INFO L435 NwaCegarLoop]: 640 mSDtfsCounter, 1991 mSDsluCounter, 14353 mSDsCounter, 0 mSdLazyCounter, 9786 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1991 SdHoareTripleChecker+Valid, 14993 SdHoareTripleChecker+Invalid, 9788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:07,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1991 Valid, 14993 Invalid, 9788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9786 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-03-16 19:36:07,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14349 states. [2025-03-16 19:36:07,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14349 to 2225. [2025-03-16 19:36:07,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2225 states, 2224 states have (on average 1.4388489208633093) internal successors, (3200), 2224 states have internal predecessors, (3200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:07,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2225 states to 2225 states and 3200 transitions. [2025-03-16 19:36:07,988 INFO L78 Accepts]: Start accepts. Automaton has 2225 states and 3200 transitions. Word has length 104 [2025-03-16 19:36:07,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:07,988 INFO L471 AbstractCegarLoop]: Abstraction has 2225 states and 3200 transitions. [2025-03-16 19:36:07,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.810810810810811) internal successors, (104), 37 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:07,989 INFO L276 IsEmpty]: Start isEmpty. Operand 2225 states and 3200 transitions. [2025-03-16 19:36:07,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-16 19:36:07,990 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:07,990 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:36:07,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 19:36:07,990 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:36:07,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:07,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1826383510, now seen corresponding path program 1 times [2025-03-16 19:36:07,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:07,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6461448] [2025-03-16 19:36:07,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:07,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:08,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-16 19:36:08,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-16 19:36:08,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:08,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:08,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:36:08,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:08,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6461448] [2025-03-16 19:36:08,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6461448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:08,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:08,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-16 19:36:08,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511610547] [2025-03-16 19:36:08,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:08,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 19:36:08,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:08,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 19:36:08,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-16 19:36:08,488 INFO L87 Difference]: Start difference. First operand 2225 states and 3200 transitions. Second operand has 14 states, 14 states have (on average 7.428571428571429) internal successors, (104), 13 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:09,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:09,113 INFO L93 Difference]: Finished difference Result 8825 states and 12863 transitions. [2025-03-16 19:36:09,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 19:36:09,114 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.428571428571429) internal successors, (104), 13 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2025-03-16 19:36:09,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:09,124 INFO L225 Difference]: With dead ends: 8825 [2025-03-16 19:36:09,124 INFO L226 Difference]: Without dead ends: 8254 [2025-03-16 19:36:09,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2025-03-16 19:36:09,128 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 983 mSDsluCounter, 3439 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 983 SdHoareTripleChecker+Valid, 3912 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:09,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [983 Valid, 3912 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:36:09,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8254 states. [2025-03-16 19:36:09,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8254 to 2188. [2025-03-16 19:36:09,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2188 states, 2187 states have (on average 1.440329218106996) internal successors, (3150), 2187 states have internal predecessors, (3150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:09,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2188 states to 2188 states and 3150 transitions. [2025-03-16 19:36:09,171 INFO L78 Accepts]: Start accepts. Automaton has 2188 states and 3150 transitions. Word has length 104 [2025-03-16 19:36:09,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:09,172 INFO L471 AbstractCegarLoop]: Abstraction has 2188 states and 3150 transitions. [2025-03-16 19:36:09,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.428571428571429) internal successors, (104), 13 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:09,172 INFO L276 IsEmpty]: Start isEmpty. Operand 2188 states and 3150 transitions. [2025-03-16 19:36:09,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-16 19:36:09,173 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:09,173 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:36:09,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-16 19:36:09,174 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:36:09,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:09,175 INFO L85 PathProgramCache]: Analyzing trace with hash -788194690, now seen corresponding path program 1 times [2025-03-16 19:36:09,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:09,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051054145] [2025-03-16 19:36:09,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:09,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:09,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-16 19:36:09,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-16 19:36:09,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:09,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:09,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:36:09,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:09,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051054145] [2025-03-16 19:36:09,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051054145] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:09,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:09,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-16 19:36:09,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133287554] [2025-03-16 19:36:09,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:09,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-16 19:36:09,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:09,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-16 19:36:09,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:36:09,872 INFO L87 Difference]: Start difference. First operand 2188 states and 3150 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 17 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:11,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:11,186 INFO L93 Difference]: Finished difference Result 12693 states and 18545 transitions. [2025-03-16 19:36:11,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-16 19:36:11,187 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 17 states have internal predecessors, (105), 0 states have call successors, (0), 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-16 19:36:11,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:11,197 INFO L225 Difference]: With dead ends: 12693 [2025-03-16 19:36:11,197 INFO L226 Difference]: Without dead ends: 12163 [2025-03-16 19:36:11,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=335, Invalid=1147, Unknown=0, NotChecked=0, Total=1482 [2025-03-16 19:36:11,201 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 2058 mSDsluCounter, 3374 mSDsCounter, 0 mSdLazyCounter, 1107 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2058 SdHoareTripleChecker+Valid, 3766 SdHoareTripleChecker+Invalid, 1108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:11,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2058 Valid, 3766 Invalid, 1108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1107 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:36:11,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12163 states. [2025-03-16 19:36:11,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12163 to 2208. [2025-03-16 19:36:11,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2208 states, 2207 states have (on average 1.4381513366560943) internal successors, (3174), 2207 states have internal predecessors, (3174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:11,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2208 states to 2208 states and 3174 transitions. [2025-03-16 19:36:11,290 INFO L78 Accepts]: Start accepts. Automaton has 2208 states and 3174 transitions. Word has length 105 [2025-03-16 19:36:11,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:11,290 INFO L471 AbstractCegarLoop]: Abstraction has 2208 states and 3174 transitions. [2025-03-16 19:36:11,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 17 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:11,291 INFO L276 IsEmpty]: Start isEmpty. Operand 2208 states and 3174 transitions. [2025-03-16 19:36:11,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-16 19:36:11,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:11,291 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:36:11,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-16 19:36:11,292 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:36:11,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:11,292 INFO L85 PathProgramCache]: Analyzing trace with hash -628982874, now seen corresponding path program 1 times [2025-03-16 19:36:11,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:11,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824348409] [2025-03-16 19:36:11,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:11,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:11,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-16 19:36:11,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-16 19:36:11,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:11,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:11,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:36:11,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:11,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824348409] [2025-03-16 19:36:11,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824348409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:11,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:11,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-16 19:36:11,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166038783] [2025-03-16 19:36:11,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:11,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 19:36:11,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:11,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 19:36:11,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-16 19:36:11,730 INFO L87 Difference]: Start difference. First operand 2208 states and 3174 transitions. Second operand has 14 states, 14 states have (on average 7.5) internal successors, (105), 13 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:12,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:12,541 INFO L93 Difference]: Finished difference Result 8792 states and 12810 transitions. [2025-03-16 19:36:12,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 19:36:12,542 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.5) internal successors, (105), 13 states have internal predecessors, (105), 0 states have call successors, (0), 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-16 19:36:12,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:12,550 INFO L225 Difference]: With dead ends: 8792 [2025-03-16 19:36:12,550 INFO L226 Difference]: Without dead ends: 8199 [2025-03-16 19:36:12,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2025-03-16 19:36:12,553 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 1161 mSDsluCounter, 3670 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1161 SdHoareTripleChecker+Valid, 4212 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:12,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1161 Valid, 4212 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:36:12,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8199 states. [2025-03-16 19:36:12,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8199 to 2143. [2025-03-16 19:36:12,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2143 states, 2142 states have (on average 1.442110177404295) internal successors, (3089), 2142 states have internal predecessors, (3089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:12,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2143 states to 2143 states and 3089 transitions. [2025-03-16 19:36:12,614 INFO L78 Accepts]: Start accepts. Automaton has 2143 states and 3089 transitions. Word has length 105 [2025-03-16 19:36:12,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:12,615 INFO L471 AbstractCegarLoop]: Abstraction has 2143 states and 3089 transitions. [2025-03-16 19:36:12,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.5) internal successors, (105), 13 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:12,615 INFO L276 IsEmpty]: Start isEmpty. Operand 2143 states and 3089 transitions. [2025-03-16 19:36:12,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-16 19:36:12,615 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:12,615 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:36:12,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-16 19:36:12,616 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:36:12,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:12,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1228380297, now seen corresponding path program 1 times [2025-03-16 19:36:12,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:12,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207015717] [2025-03-16 19:36:12,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:12,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:12,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-16 19:36:12,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-16 19:36:12,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:12,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:12,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:36:12,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:12,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207015717] [2025-03-16 19:36:12,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207015717] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:12,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:12,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:36:12,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770465369] [2025-03-16 19:36:12,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:12,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:36:12,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:12,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:36:12,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:36:12,705 INFO L87 Difference]: Start difference. First operand 2143 states and 3089 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:12,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:12,731 INFO L93 Difference]: Finished difference Result 4946 states and 7205 transitions. [2025-03-16 19:36:12,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:36:12,731 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 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-16 19:36:12,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:12,734 INFO L225 Difference]: With dead ends: 4946 [2025-03-16 19:36:12,734 INFO L226 Difference]: Without dead ends: 2971 [2025-03-16 19:36:12,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:36:12,739 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 107 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:12,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 604 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:36:12,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2971 states. [2025-03-16 19:36:12,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2971 to 2969. [2025-03-16 19:36:12,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2969 states, 2968 states have (on average 1.4440700808625337) internal successors, (4286), 2968 states have internal predecessors, (4286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:12,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2969 states to 2969 states and 4286 transitions. [2025-03-16 19:36:12,764 INFO L78 Accepts]: Start accepts. Automaton has 2969 states and 4286 transitions. Word has length 105 [2025-03-16 19:36:12,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:12,765 INFO L471 AbstractCegarLoop]: Abstraction has 2969 states and 4286 transitions. [2025-03-16 19:36:12,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:12,765 INFO L276 IsEmpty]: Start isEmpty. Operand 2969 states and 4286 transitions. [2025-03-16 19:36:12,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-16 19:36:12,766 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:12,766 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:36:12,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-16 19:36:12,766 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:36:12,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:12,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1196176226, now seen corresponding path program 1 times [2025-03-16 19:36:12,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:12,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676878042] [2025-03-16 19:36:12,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:12,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:12,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-16 19:36:12,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-16 19:36:12,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:12,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:12,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:36:12,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:12,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676878042] [2025-03-16 19:36:12,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676878042] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:12,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:12,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:36:12,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350187929] [2025-03-16 19:36:12,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:12,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:36:12,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:12,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:36:12,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:36:12,897 INFO L87 Difference]: Start difference. First operand 2969 states and 4286 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:12,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:12,918 INFO L93 Difference]: Finished difference Result 2985 states and 4308 transitions. [2025-03-16 19:36:12,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:36:12,919 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 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-16 19:36:12,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:12,921 INFO L225 Difference]: With dead ends: 2985 [2025-03-16 19:36:12,921 INFO L226 Difference]: Without dead ends: 2983 [2025-03-16 19:36:12,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:36:12,922 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 0 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:12,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 845 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:36:12,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2983 states. [2025-03-16 19:36:12,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2983 to 2983. [2025-03-16 19:36:12,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2983 states, 2982 states have (on average 1.4369550637156272) internal successors, (4285), 2982 states have internal predecessors, (4285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:12,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2983 states to 2983 states and 4285 transitions. [2025-03-16 19:36:12,944 INFO L78 Accepts]: Start accepts. Automaton has 2983 states and 4285 transitions. Word has length 105 [2025-03-16 19:36:12,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:12,944 INFO L471 AbstractCegarLoop]: Abstraction has 2983 states and 4285 transitions. [2025-03-16 19:36:12,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:12,944 INFO L276 IsEmpty]: Start isEmpty. Operand 2983 states and 4285 transitions. [2025-03-16 19:36:12,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-16 19:36:12,945 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:12,945 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:36:12,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-16 19:36:12,945 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:36:12,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:12,946 INFO L85 PathProgramCache]: Analyzing trace with hash -654480690, now seen corresponding path program 1 times [2025-03-16 19:36:12,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:12,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208912183] [2025-03-16 19:36:12,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:12,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:12,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-16 19:36:12,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-16 19:36:12,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:12,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:13,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:36:13,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:13,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208912183] [2025-03-16 19:36:13,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208912183] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:13,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:13,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 19:36:13,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240073029] [2025-03-16 19:36:13,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:13,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 19:36:13,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:13,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 19:36:13,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:36:13,325 INFO L87 Difference]: Start difference. First operand 2983 states and 4285 transitions. Second operand has 13 states, 13 states have (on average 8.076923076923077) internal successors, (105), 12 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:13,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:13,790 INFO L93 Difference]: Finished difference Result 6595 states and 9537 transitions. [2025-03-16 19:36:13,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 19:36:13,790 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.076923076923077) internal successors, (105), 12 states have internal predecessors, (105), 0 states have call successors, (0), 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-16 19:36:13,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:13,794 INFO L225 Difference]: With dead ends: 6595 [2025-03-16 19:36:13,794 INFO L226 Difference]: Without dead ends: 5807 [2025-03-16 19:36:13,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-03-16 19:36:13,796 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 981 mSDsluCounter, 1233 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 981 SdHoareTripleChecker+Valid, 1415 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:13,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [981 Valid, 1415 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:36:13,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5807 states. [2025-03-16 19:36:13,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5807 to 2952. [2025-03-16 19:36:13,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2952 states, 2951 states have (on average 1.4384954252795663) internal successors, (4245), 2951 states have internal predecessors, (4245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:13,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2952 states to 2952 states and 4245 transitions. [2025-03-16 19:36:13,834 INFO L78 Accepts]: Start accepts. Automaton has 2952 states and 4245 transitions. Word has length 105 [2025-03-16 19:36:13,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:13,834 INFO L471 AbstractCegarLoop]: Abstraction has 2952 states and 4245 transitions. [2025-03-16 19:36:13,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.076923076923077) internal successors, (105), 12 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:13,835 INFO L276 IsEmpty]: Start isEmpty. Operand 2952 states and 4245 transitions. [2025-03-16 19:36:13,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-16 19:36:13,835 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:13,835 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:36:13,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-16 19:36:13,836 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:36:13,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:13,836 INFO L85 PathProgramCache]: Analyzing trace with hash -96691798, now seen corresponding path program 1 times [2025-03-16 19:36:13,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:13,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339426970] [2025-03-16 19:36:13,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:13,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:13,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-16 19:36:13,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-16 19:36:13,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:13,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:14,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:36:14,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:14,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339426970] [2025-03-16 19:36:14,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339426970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:14,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:14,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-16 19:36:14,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610124494] [2025-03-16 19:36:14,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:14,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 19:36:14,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:14,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 19:36:14,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-16 19:36:14,253 INFO L87 Difference]: Start difference. First operand 2952 states and 4245 transitions. Second operand has 14 states, 14 states have (on average 7.571428571428571) internal successors, (106), 13 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:14,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:14,786 INFO L93 Difference]: Finished difference Result 12203 states and 17696 transitions. [2025-03-16 19:36:14,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 19:36:14,787 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.571428571428571) internal successors, (106), 13 states have internal predecessors, (106), 0 states have call successors, (0), 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-16 19:36:14,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:14,797 INFO L225 Difference]: With dead ends: 12203 [2025-03-16 19:36:14,797 INFO L226 Difference]: Without dead ends: 11407 [2025-03-16 19:36:14,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2025-03-16 19:36:14,801 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 1099 mSDsluCounter, 2380 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1099 SdHoareTripleChecker+Valid, 2562 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:14,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1099 Valid, 2562 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:36:14,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11407 states. [2025-03-16 19:36:14,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11407 to 2941. [2025-03-16 19:36:14,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2941 states, 2940 states have (on average 1.4391156462585033) internal successors, (4231), 2940 states have internal predecessors, (4231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:14,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2941 states to 2941 states and 4231 transitions. [2025-03-16 19:36:14,860 INFO L78 Accepts]: Start accepts. Automaton has 2941 states and 4231 transitions. Word has length 106 [2025-03-16 19:36:14,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:14,860 INFO L471 AbstractCegarLoop]: Abstraction has 2941 states and 4231 transitions. [2025-03-16 19:36:14,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.571428571428571) internal successors, (106), 13 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:14,861 INFO L276 IsEmpty]: Start isEmpty. Operand 2941 states and 4231 transitions. [2025-03-16 19:36:14,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-16 19:36:14,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:14,862 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:36:14,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-16 19:36:14,862 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:36:14,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:14,862 INFO L85 PathProgramCache]: Analyzing trace with hash -883434622, now seen corresponding path program 1 times [2025-03-16 19:36:14,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:14,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921641426] [2025-03-16 19:36:14,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:14,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:14,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-16 19:36:14,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-16 19:36:14,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:14,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:14,948 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:36:14,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:14,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921641426] [2025-03-16 19:36:14,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921641426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:14,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:14,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:36:14,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834298228] [2025-03-16 19:36:14,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:14,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:36:14,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:14,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:36:14,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:36:14,950 INFO L87 Difference]: Start difference. First operand 2941 states and 4231 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:14,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:14,969 INFO L93 Difference]: Finished difference Result 6062 states and 8763 transitions. [2025-03-16 19:36:14,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:36:14,969 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 137 [2025-03-16 19:36:14,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:14,973 INFO L225 Difference]: With dead ends: 6062 [2025-03-16 19:36:14,973 INFO L226 Difference]: Without dead ends: 4073 [2025-03-16 19:36:14,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-16 19:36:14,975 INFO L435 NwaCegarLoop]: 295 mSDtfsCounter, 100 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:14,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 470 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:36:14,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4073 states. [2025-03-16 19:36:15,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4073 to 3947. [2025-03-16 19:36:15,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3947 states, 3946 states have (on average 1.4374049670552458) internal successors, (5672), 3946 states have internal predecessors, (5672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:15,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3947 states to 3947 states and 5672 transitions. [2025-03-16 19:36:15,010 INFO L78 Accepts]: Start accepts. Automaton has 3947 states and 5672 transitions. Word has length 137 [2025-03-16 19:36:15,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:15,011 INFO L471 AbstractCegarLoop]: Abstraction has 3947 states and 5672 transitions. [2025-03-16 19:36:15,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:15,011 INFO L276 IsEmpty]: Start isEmpty. Operand 3947 states and 5672 transitions. [2025-03-16 19:36:15,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-16 19:36:15,011 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:15,012 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:36:15,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-16 19:36:15,012 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:36:15,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:15,012 INFO L85 PathProgramCache]: Analyzing trace with hash 168819498, now seen corresponding path program 1 times [2025-03-16 19:36:15,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:15,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005927011] [2025-03-16 19:36:15,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:15,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:15,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-16 19:36:15,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-16 19:36:15,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:15,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:15,100 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:36:15,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:15,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005927011] [2025-03-16 19:36:15,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005927011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:15,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:15,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:36:15,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061673054] [2025-03-16 19:36:15,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:15,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:36:15,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:15,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:36:15,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:36:15,102 INFO L87 Difference]: Start difference. First operand 3947 states and 5672 transitions. Second operand has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:15,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:15,342 INFO L93 Difference]: Finished difference Result 10600 states and 15384 transitions. [2025-03-16 19:36:15,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:36:15,343 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2025-03-16 19:36:15,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:15,349 INFO L225 Difference]: With dead ends: 10600 [2025-03-16 19:36:15,349 INFO L226 Difference]: Without dead ends: 6788 [2025-03-16 19:36:15,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:36:15,353 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 1042 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1042 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:15,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1042 Valid, 498 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:36:15,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6788 states. [2025-03-16 19:36:15,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6788 to 4226. [2025-03-16 19:36:15,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4226 states, 4225 states have (on average 1.4305325443786983) internal successors, (6044), 4225 states have internal predecessors, (6044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:15,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4226 states to 4226 states and 6044 transitions. [2025-03-16 19:36:15,393 INFO L78 Accepts]: Start accepts. Automaton has 4226 states and 6044 transitions. Word has length 139 [2025-03-16 19:36:15,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:15,393 INFO L471 AbstractCegarLoop]: Abstraction has 4226 states and 6044 transitions. [2025-03-16 19:36:15,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:15,393 INFO L276 IsEmpty]: Start isEmpty. Operand 4226 states and 6044 transitions. [2025-03-16 19:36:15,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-16 19:36:15,394 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:15,394 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:36:15,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-16 19:36:15,394 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:36:15,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:15,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1411943446, now seen corresponding path program 1 times [2025-03-16 19:36:15,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:15,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393998998] [2025-03-16 19:36:15,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:15,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:15,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-16 19:36:15,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-16 19:36:15,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:15,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:15,482 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:36:15,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:15,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393998998] [2025-03-16 19:36:15,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393998998] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:15,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:15,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:36:15,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641367799] [2025-03-16 19:36:15,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:15,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:36:15,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:15,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:36:15,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:36:15,484 INFO L87 Difference]: Start difference. First operand 4226 states and 6044 transitions. Second operand has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:15,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:15,700 INFO L93 Difference]: Finished difference Result 17146 states and 24892 transitions. [2025-03-16 19:36:15,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:36:15,700 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2025-03-16 19:36:15,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:15,714 INFO L225 Difference]: With dead ends: 17146 [2025-03-16 19:36:15,714 INFO L226 Difference]: Without dead ends: 13064 [2025-03-16 19:36:15,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:36:15,721 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 1233 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1233 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:15,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1233 Valid, 414 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:36:15,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13064 states. [2025-03-16 19:36:15,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13064 to 8886. [2025-03-16 19:36:15,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8886 states, 8885 states have (on average 1.4339898705683736) internal successors, (12741), 8885 states have internal predecessors, (12741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:15,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8886 states to 8886 states and 12741 transitions. [2025-03-16 19:36:15,827 INFO L78 Accepts]: Start accepts. Automaton has 8886 states and 12741 transitions. Word has length 139 [2025-03-16 19:36:15,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:15,828 INFO L471 AbstractCegarLoop]: Abstraction has 8886 states and 12741 transitions. [2025-03-16 19:36:15,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:15,828 INFO L276 IsEmpty]: Start isEmpty. Operand 8886 states and 12741 transitions. [2025-03-16 19:36:15,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-16 19:36:15,829 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:15,829 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:36:15,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-16 19:36:15,829 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:36:15,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:15,830 INFO L85 PathProgramCache]: Analyzing trace with hash 934890666, now seen corresponding path program 1 times [2025-03-16 19:36:15,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:15,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911791602] [2025-03-16 19:36:15,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:15,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:15,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-16 19:36:15,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-16 19:36:15,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:15,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:15,916 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:36:15,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:15,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911791602] [2025-03-16 19:36:15,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911791602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:15,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:15,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:36:15,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180911981] [2025-03-16 19:36:15,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:15,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:36:15,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:15,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:36:15,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:36:15,917 INFO L87 Difference]: Start difference. First operand 8886 states and 12741 transitions. Second operand has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:16,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:16,169 INFO L93 Difference]: Finished difference Result 33562 states and 48579 transitions. [2025-03-16 19:36:16,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:36:16,170 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2025-03-16 19:36:16,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:16,198 INFO L225 Difference]: With dead ends: 33562 [2025-03-16 19:36:16,198 INFO L226 Difference]: Without dead ends: 24820 [2025-03-16 19:36:16,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:36:16,212 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 1148 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1148 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:16,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1148 Valid, 412 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:36:16,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24820 states. [2025-03-16 19:36:16,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24820 to 18786. [2025-03-16 19:36:16,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18786 states, 18785 states have (on average 1.4344956081980302) internal successors, (26947), 18785 states have internal predecessors, (26947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:16,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18786 states to 18786 states and 26947 transitions. [2025-03-16 19:36:16,405 INFO L78 Accepts]: Start accepts. Automaton has 18786 states and 26947 transitions. Word has length 139 [2025-03-16 19:36:16,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:16,406 INFO L471 AbstractCegarLoop]: Abstraction has 18786 states and 26947 transitions. [2025-03-16 19:36:16,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:16,406 INFO L276 IsEmpty]: Start isEmpty. Operand 18786 states and 26947 transitions. [2025-03-16 19:36:16,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-16 19:36:16,406 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:16,406 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:36:16,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-16 19:36:16,407 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:36:16,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:16,407 INFO L85 PathProgramCache]: Analyzing trace with hash 280453514, now seen corresponding path program 1 times [2025-03-16 19:36:16,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:16,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466769587] [2025-03-16 19:36:16,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:16,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:16,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-16 19:36:16,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-16 19:36:16,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:16,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:16,529 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:36:16,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:16,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466769587] [2025-03-16 19:36:16,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466769587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:16,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:16,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:36:16,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020220353] [2025-03-16 19:36:16,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:16,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:36:16,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:16,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:36:16,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:36:16,530 INFO L87 Difference]: Start difference. First operand 18786 states and 26947 transitions. Second operand has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:16,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:16,820 INFO L93 Difference]: Finished difference Result 65814 states and 94909 transitions. [2025-03-16 19:36:16,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:36:16,821 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2025-03-16 19:36:16,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:16,872 INFO L225 Difference]: With dead ends: 65814 [2025-03-16 19:36:16,872 INFO L226 Difference]: Without dead ends: 47172 [2025-03-16 19:36:16,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:36:16,897 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 1063 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1063 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:16,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1063 Valid, 410 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:36:16,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47172 states. [2025-03-16 19:36:17,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47172 to 39746. [2025-03-16 19:36:17,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39746 states, 39745 states have (on average 1.4337149326959366) internal successors, (56983), 39745 states have internal predecessors, (56983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:17,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39746 states to 39746 states and 56983 transitions. [2025-03-16 19:36:17,438 INFO L78 Accepts]: Start accepts. Automaton has 39746 states and 56983 transitions. Word has length 139 [2025-03-16 19:36:17,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:17,438 INFO L471 AbstractCegarLoop]: Abstraction has 39746 states and 56983 transitions. [2025-03-16 19:36:17,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:17,438 INFO L276 IsEmpty]: Start isEmpty. Operand 39746 states and 56983 transitions. [2025-03-16 19:36:17,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-16 19:36:17,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:17,440 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:36:17,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-16 19:36:17,440 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:36:17,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:17,440 INFO L85 PathProgramCache]: Analyzing trace with hash 723403112, now seen corresponding path program 1 times [2025-03-16 19:36:17,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:17,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612543421] [2025-03-16 19:36:17,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:17,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:17,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-16 19:36:17,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-16 19:36:17,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:17,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:17,563 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:36:17,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:17,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612543421] [2025-03-16 19:36:17,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612543421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:17,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:17,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:36:17,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113510607] [2025-03-16 19:36:17,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:17,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:36:17,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:17,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:36:17,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:36:17,567 INFO L87 Difference]: Start difference. First operand 39746 states and 56983 transitions. Second operand has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:17,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:17,929 INFO L93 Difference]: Finished difference Result 129158 states and 185481 transitions. [2025-03-16 19:36:17,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:36:17,929 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2025-03-16 19:36:17,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:18,027 INFO L225 Difference]: With dead ends: 129158 [2025-03-16 19:36:18,027 INFO L226 Difference]: Without dead ends: 89556 [2025-03-16 19:36:18,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:36:18,071 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 977 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 977 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:18,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [977 Valid, 408 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:36:18,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89556 states. [2025-03-16 19:36:18,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89556 to 83986. [2025-03-16 19:36:18,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83986 states, 83985 states have (on average 1.432434363279157) internal successors, (120303), 83985 states have internal predecessors, (120303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:19,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83986 states to 83986 states and 120303 transitions. [2025-03-16 19:36:19,063 INFO L78 Accepts]: Start accepts. Automaton has 83986 states and 120303 transitions. Word has length 139 [2025-03-16 19:36:19,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:19,064 INFO L471 AbstractCegarLoop]: Abstraction has 83986 states and 120303 transitions. [2025-03-16 19:36:19,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:19,064 INFO L276 IsEmpty]: Start isEmpty. Operand 83986 states and 120303 transitions. [2025-03-16 19:36:19,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-16 19:36:19,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:19,075 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:36:19,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-16 19:36:19,076 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:36:19,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:19,078 INFO L85 PathProgramCache]: Analyzing trace with hash 705499060, now seen corresponding path program 1 times [2025-03-16 19:36:19,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:19,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416567547] [2025-03-16 19:36:19,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:19,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:19,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-16 19:36:19,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-16 19:36:19,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:19,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:19,151 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-16 19:36:19,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:19,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416567547] [2025-03-16 19:36:19,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416567547] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:19,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:19,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:36:19,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127020993] [2025-03-16 19:36:19,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:19,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:36:19,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:19,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:36:19,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:36:19,154 INFO L87 Difference]: Start difference. First operand 83986 states and 120303 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:19,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:19,572 INFO L93 Difference]: Finished difference Result 162934 states and 232993 transitions. [2025-03-16 19:36:19,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:36:19,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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 170 [2025-03-16 19:36:19,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:19,649 INFO L225 Difference]: With dead ends: 162934 [2025-03-16 19:36:19,649 INFO L226 Difference]: Without dead ends: 79089 [2025-03-16 19:36:19,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:36:19,698 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 93 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:19,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 457 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:36:19,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79089 states. [2025-03-16 19:36:20,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79089 to 77641. [2025-03-16 19:36:20,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77641 states, 77640 states have (on average 1.4226043276661515) internal successors, (110451), 77640 states have internal predecessors, (110451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:20,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77641 states to 77641 states and 110451 transitions. [2025-03-16 19:36:20,817 INFO L78 Accepts]: Start accepts. Automaton has 77641 states and 110451 transitions. Word has length 170 [2025-03-16 19:36:20,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:20,817 INFO L471 AbstractCegarLoop]: Abstraction has 77641 states and 110451 transitions. [2025-03-16 19:36:20,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:20,818 INFO L276 IsEmpty]: Start isEmpty. Operand 77641 states and 110451 transitions. [2025-03-16 19:36:20,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-16 19:36:20,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:20,828 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:36:20,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-16 19:36:20,828 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:36:20,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:20,829 INFO L85 PathProgramCache]: Analyzing trace with hash -429001318, now seen corresponding path program 1 times [2025-03-16 19:36:20,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:20,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21553944] [2025-03-16 19:36:20,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:20,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:20,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-16 19:36:20,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-16 19:36:20,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:20,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:20,910 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-16 19:36:20,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:20,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21553944] [2025-03-16 19:36:20,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21553944] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:20,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:20,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:36:20,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383258161] [2025-03-16 19:36:20,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:20,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:36:20,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:20,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:36:20,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:36:20,911 INFO L87 Difference]: Start difference. First operand 77641 states and 110451 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:21,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:21,334 INFO L93 Difference]: Finished difference Result 150277 states and 213333 transitions. [2025-03-16 19:36:21,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:36:21,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 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 171 [2025-03-16 19:36:21,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:21,414 INFO L225 Difference]: With dead ends: 150277 [2025-03-16 19:36:21,415 INFO L226 Difference]: Without dead ends: 72771 [2025-03-16 19:36:21,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:36:21,458 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 86 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:21,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 458 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:36:21,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72771 states. [2025-03-16 19:36:22,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72771 to 71377. [2025-03-16 19:36:22,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71377 states, 71376 states have (on average 1.4109364492266308) internal successors, (100707), 71376 states have internal predecessors, (100707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:22,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71377 states to 71377 states and 100707 transitions. [2025-03-16 19:36:22,308 INFO L78 Accepts]: Start accepts. Automaton has 71377 states and 100707 transitions. Word has length 171 [2025-03-16 19:36:22,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:22,308 INFO L471 AbstractCegarLoop]: Abstraction has 71377 states and 100707 transitions. [2025-03-16 19:36:22,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:22,308 INFO L276 IsEmpty]: Start isEmpty. Operand 71377 states and 100707 transitions. [2025-03-16 19:36:22,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-16 19:36:22,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:22,316 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:36:22,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-16 19:36:22,316 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:36:22,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:22,316 INFO L85 PathProgramCache]: Analyzing trace with hash -546473951, now seen corresponding path program 1 times [2025-03-16 19:36:22,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:22,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162846465] [2025-03-16 19:36:22,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:22,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:22,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-16 19:36:22,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-16 19:36:22,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:22,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:22,397 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-16 19:36:22,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:22,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162846465] [2025-03-16 19:36:22,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162846465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:22,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:22,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:36:22,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349125143] [2025-03-16 19:36:22,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:22,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:36:22,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:22,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:36:22,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:36:22,399 INFO L87 Difference]: Start difference. First operand 71377 states and 100707 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:22,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:22,866 INFO L93 Difference]: Finished difference Result 137749 states and 193845 transitions. [2025-03-16 19:36:22,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:36:22,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 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 172 [2025-03-16 19:36:22,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:22,936 INFO L225 Difference]: With dead ends: 137749 [2025-03-16 19:36:22,937 INFO L226 Difference]: Without dead ends: 66507 [2025-03-16 19:36:22,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:36:22,960 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 80 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:22,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 459 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:36:22,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66507 states. [2025-03-16 19:36:23,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66507 to 65113. [2025-03-16 19:36:23,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65113 states, 65112 states have (on average 1.3970235901216366) internal successors, (90963), 65112 states have internal predecessors, (90963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:23,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65113 states to 65113 states and 90963 transitions. [2025-03-16 19:36:23,672 INFO L78 Accepts]: Start accepts. Automaton has 65113 states and 90963 transitions. Word has length 172 [2025-03-16 19:36:23,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:23,672 INFO L471 AbstractCegarLoop]: Abstraction has 65113 states and 90963 transitions. [2025-03-16 19:36:23,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:23,672 INFO L276 IsEmpty]: Start isEmpty. Operand 65113 states and 90963 transitions. [2025-03-16 19:36:23,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-16 19:36:23,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:23,679 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:36:23,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-16 19:36:23,680 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:36:23,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:23,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1400688807, now seen corresponding path program 1 times [2025-03-16 19:36:23,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:23,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011651402] [2025-03-16 19:36:23,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:23,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:23,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-16 19:36:23,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-16 19:36:23,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:23,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:23,947 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-16 19:36:23,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:23,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011651402] [2025-03-16 19:36:23,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011651402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:23,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:23,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:36:23,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831323170] [2025-03-16 19:36:23,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:23,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:36:23,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:23,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:36:23,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:36:23,948 INFO L87 Difference]: Start difference. First operand 65113 states and 90963 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:24,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:24,167 INFO L93 Difference]: Finished difference Result 125221 states and 174357 transitions. [2025-03-16 19:36:24,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:36:24,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 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 173 [2025-03-16 19:36:24,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:24,232 INFO L225 Difference]: With dead ends: 125221 [2025-03-16 19:36:24,232 INFO L226 Difference]: Without dead ends: 60243 [2025-03-16 19:36:24,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:36:24,277 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 71 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:24,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 461 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:36:24,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60243 states. [2025-03-16 19:36:24,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60243 to 58849. [2025-03-16 19:36:24,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58849 states, 58848 states have (on average 1.3801488580750407) internal successors, (81219), 58848 states have internal predecessors, (81219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:25,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58849 states to 58849 states and 81219 transitions. [2025-03-16 19:36:25,048 INFO L78 Accepts]: Start accepts. Automaton has 58849 states and 81219 transitions. Word has length 173 [2025-03-16 19:36:25,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:25,048 INFO L471 AbstractCegarLoop]: Abstraction has 58849 states and 81219 transitions. [2025-03-16 19:36:25,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:25,048 INFO L276 IsEmpty]: Start isEmpty. Operand 58849 states and 81219 transitions. [2025-03-16 19:36:25,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-16 19:36:25,054 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:25,054 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:36:25,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-16 19:36:25,054 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:36:25,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:25,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1535455630, now seen corresponding path program 1 times [2025-03-16 19:36:25,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:25,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408423371] [2025-03-16 19:36:25,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:25,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:25,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-16 19:36:25,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-16 19:36:25,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:25,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:25,186 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 19:36:25,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:25,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408423371] [2025-03-16 19:36:25,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408423371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:25,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:25,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:36:25,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553460890] [2025-03-16 19:36:25,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:25,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:36:25,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:25,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:36:25,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:36:25,187 INFO L87 Difference]: Start difference. First operand 58849 states and 81219 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:25,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:25,521 INFO L93 Difference]: Finished difference Result 171173 states and 235013 transitions. [2025-03-16 19:36:25,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:36:25,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 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 174 [2025-03-16 19:36:25,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:25,647 INFO L225 Difference]: With dead ends: 171173 [2025-03-16 19:36:25,647 INFO L226 Difference]: Without dead ends: 112459 [2025-03-16 19:36:25,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:36:25,708 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 64 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:25,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 462 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:36:25,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112459 states. [2025-03-16 19:36:26,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112459 to 105961. [2025-03-16 19:36:26,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105961 states, 105960 states have (on average 1.365222725556814) internal successors, (144659), 105960 states have internal predecessors, (144659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:26,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105961 states to 105961 states and 144659 transitions. [2025-03-16 19:36:26,976 INFO L78 Accepts]: Start accepts. Automaton has 105961 states and 144659 transitions. Word has length 174 [2025-03-16 19:36:26,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:26,976 INFO L471 AbstractCegarLoop]: Abstraction has 105961 states and 144659 transitions. [2025-03-16 19:36:26,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:26,976 INFO L276 IsEmpty]: Start isEmpty. Operand 105961 states and 144659 transitions. [2025-03-16 19:36:26,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-16 19:36:26,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:26,984 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:36:26,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-16 19:36:26,984 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:36:26,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:26,985 INFO L85 PathProgramCache]: Analyzing trace with hash 100020787, now seen corresponding path program 1 times [2025-03-16 19:36:26,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:26,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71148317] [2025-03-16 19:36:26,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:26,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:26,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-16 19:36:27,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-16 19:36:27,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:27,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:27,603 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 21 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:36:27,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:27,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71148317] [2025-03-16 19:36:27,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71148317] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:36:27,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493919531] [2025-03-16 19:36:27,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:27,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:36:27,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:36:27,606 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:36:27,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 19:36:27,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-16 19:36:27,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-16 19:36:27,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:27,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:27,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 735 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-16 19:36:27,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:36:29,044 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:36:29,044 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:36:31,080 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:36:31,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493919531] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:36:31,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:36:31,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 15] total 37 [2025-03-16 19:36:31,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201467604] [2025-03-16 19:36:31,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:36:31,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-16 19:36:31,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:31,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-16 19:36:31,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1221, Unknown=0, NotChecked=0, Total=1406 [2025-03-16 19:36:31,083 INFO L87 Difference]: Start difference. First operand 105961 states and 144659 transitions. Second operand has 38 states, 38 states have (on average 13.289473684210526) internal successors, (505), 37 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)