./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.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.4.ufo.BOUNDED-8.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 3fd48462b17ddbaf278fc488df1a3ae435e9f6d18bb30b30a9517aad37d6aece --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:32:03,491 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:32:03,542 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:32:03,547 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:32:03,548 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:32:03,569 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:32:03,570 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:32:03,570 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:32:03,570 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:32:03,571 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:32:03,571 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:32:03,572 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:32:03,572 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:32:03,572 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:32:03,572 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:32:03,572 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:32:03,572 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:32:03,573 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:32:03,573 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:32:03,573 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:32:03,573 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:32:03,573 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:32:03,573 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:32:03,573 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:32:03,573 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:32:03,573 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:32:03,573 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:32:03,573 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:32:03,573 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:32:03,573 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:32:03,573 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:32:03,573 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:32:03,573 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:32:03,573 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:32:03,573 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:32:03,573 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:32:03,573 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:32:03,573 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:32:03,573 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:32:03,573 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:32:03,573 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:32:03,573 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:32:03,574 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:32:03,574 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 -> 3fd48462b17ddbaf278fc488df1a3ae435e9f6d18bb30b30a9517aad37d6aece [2025-03-16 19:32:03,805 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:32:03,815 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:32:03,817 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:32:03,818 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:32:03,818 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:32:03,819 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2025-03-16 19:32:04,954 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91e7d49e7/1f5ea0ece656453ca478feaaba09dbba/FLAG74208200d [2025-03-16 19:32:05,229 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:32:05,231 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2025-03-16 19:32:05,242 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91e7d49e7/1f5ea0ece656453ca478feaaba09dbba/FLAG74208200d [2025-03-16 19:32:05,257 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91e7d49e7/1f5ea0ece656453ca478feaaba09dbba [2025-03-16 19:32:05,258 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:32:05,262 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:32:05,263 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:32:05,263 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:32:05,266 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:32:05,267 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:32:05" (1/1) ... [2025-03-16 19:32:05,268 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@556ffe32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:32:05, skipping insertion in model container [2025-03-16 19:32:05,268 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:32:05" (1/1) ... [2025-03-16 19:32:05,295 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:32:05,431 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.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c[6778,6791] [2025-03-16 19:32:05,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:32:05,477 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:32:05,522 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.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c[6778,6791] [2025-03-16 19:32:05,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:32:05,550 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:32:05,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:32:05 WrapperNode [2025-03-16 19:32:05,551 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:32:05,553 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:32:05,553 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:32:05,553 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:32:05,558 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:32:05" (1/1) ... [2025-03-16 19:32:05,569 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:32:05" (1/1) ... [2025-03-16 19:32:05,591 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 574 [2025-03-16 19:32:05,592 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:32:05,592 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:32:05,592 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:32:05,592 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:32:05,603 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:32:05" (1/1) ... [2025-03-16 19:32:05,603 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:32:05" (1/1) ... [2025-03-16 19:32:05,605 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:32:05" (1/1) ... [2025-03-16 19:32:05,627 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:32:05,628 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:32:05" (1/1) ... [2025-03-16 19:32:05,628 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:32:05" (1/1) ... [2025-03-16 19:32:05,633 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:32:05" (1/1) ... [2025-03-16 19:32:05,634 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:32:05" (1/1) ... [2025-03-16 19:32:05,635 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:32:05" (1/1) ... [2025-03-16 19:32:05,636 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:32:05" (1/1) ... [2025-03-16 19:32:05,638 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:32:05,638 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:32:05,638 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:32:05,639 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:32:05,639 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:32:05" (1/1) ... [2025-03-16 19:32:05,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:32:05,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:32:05,668 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:32:05,673 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:32:05,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:32:05,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:32:05,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:32:05,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:32:05,768 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:32:05,769 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:32:06,194 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L501: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-16 19:32:06,194 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L456: havoc main_~node4____CPAchecker_TMP_0~1#1;havoc main_~node4__m4~2#1; [2025-03-16 19:32:06,194 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L591: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-16 19:32:06,195 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L396: havoc main_~node3__m3~2#1; [2025-03-16 19:32:06,195 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L546: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-16 19:32:06,195 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L381: havoc main_~node2__m2~2#1; [2025-03-16 19:32:06,195 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L365: havoc main_~node1__m1~2#1;havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1;havoc main_~node4__m4~1#1;havoc main_~node3__m3~1#1;havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1;havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-16 19:32:06,216 INFO L? ?]: Removed 73 outVars from TransFormulas that were not future-live. [2025-03-16 19:32:06,216 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:32:06,228 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:32:06,228 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:32:06,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:32:06 BoogieIcfgContainer [2025-03-16 19:32:06,228 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:32:06,230 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:32:06,230 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:32:06,233 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:32:06,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:32:05" (1/3) ... [2025-03-16 19:32:06,235 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c045e12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:32:06, skipping insertion in model container [2025-03-16 19:32:06,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:32:05" (2/3) ... [2025-03-16 19:32:06,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c045e12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:32:06, skipping insertion in model container [2025-03-16 19:32:06,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:32:06" (3/3) ... [2025-03-16 19:32:06,237 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2025-03-16 19:32:06,250 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:32:06,251 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c that has 1 procedures, 122 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-16 19:32:06,288 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:32:06,297 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;@4abb5149, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:32:06,298 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:32:06,301 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 120 states have (on average 1.7583333333333333) internal successors, (211), 121 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:06,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 19:32:06,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:06,307 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:06,308 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:06,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:06,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1176751607, now seen corresponding path program 1 times [2025-03-16 19:32:06,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:06,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121036760] [2025-03-16 19:32:06,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:06,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:06,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 19:32:06,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 19:32:06,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:06,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:06,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:32:06,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:06,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121036760] [2025-03-16 19:32:06,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121036760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:06,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:06,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:32:06,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111709569] [2025-03-16 19:32:06,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:06,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:32:06,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:06,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:32:06,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:32:06,789 INFO L87 Difference]: Start difference. First operand has 122 states, 120 states have (on average 1.7583333333333333) internal successors, (211), 121 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:07,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:07,057 INFO L93 Difference]: Finished difference Result 588 states and 941 transitions. [2025-03-16 19:32:07,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:32:07,059 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2025-03-16 19:32:07,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:07,070 INFO L225 Difference]: With dead ends: 588 [2025-03-16 19:32:07,071 INFO L226 Difference]: Without dead ends: 510 [2025-03-16 19:32:07,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:32:07,080 INFO L435 NwaCegarLoop]: 490 mSDtfsCounter, 820 mSDsluCounter, 1420 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 1910 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:07,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 1910 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:32:07,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2025-03-16 19:32:07,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 184. [2025-03-16 19:32:07,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 183 states have (on average 1.453551912568306) internal successors, (266), 183 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:07,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 266 transitions. [2025-03-16 19:32:07,125 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 266 transitions. Word has length 61 [2025-03-16 19:32:07,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:07,125 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 266 transitions. [2025-03-16 19:32:07,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:07,125 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 266 transitions. [2025-03-16 19:32:07,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-16 19:32:07,126 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:07,126 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:07,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:32:07,129 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:07,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:07,129 INFO L85 PathProgramCache]: Analyzing trace with hash 447122061, now seen corresponding path program 1 times [2025-03-16 19:32:07,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:07,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234721430] [2025-03-16 19:32:07,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:07,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:07,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-16 19:32:07,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-16 19:32:07,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:07,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:07,335 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:32:07,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:07,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234721430] [2025-03-16 19:32:07,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234721430] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:07,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:07,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:32:07,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709442084] [2025-03-16 19:32:07,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:07,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:32:07,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:07,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:32:07,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:32:07,337 INFO L87 Difference]: Start difference. First operand 184 states and 266 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:07,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:07,460 INFO L93 Difference]: Finished difference Result 653 states and 999 transitions. [2025-03-16 19:32:07,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:32:07,461 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-16 19:32:07,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:07,463 INFO L225 Difference]: With dead ends: 653 [2025-03-16 19:32:07,463 INFO L226 Difference]: Without dead ends: 553 [2025-03-16 19:32:07,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:32:07,466 INFO L435 NwaCegarLoop]: 463 mSDtfsCounter, 521 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:07,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 1118 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:32:07,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-03-16 19:32:07,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 293. [2025-03-16 19:32:07,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 292 states have (on average 1.5) internal successors, (438), 292 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:07,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 438 transitions. [2025-03-16 19:32:07,487 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 438 transitions. Word has length 63 [2025-03-16 19:32:07,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:07,487 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 438 transitions. [2025-03-16 19:32:07,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:07,487 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 438 transitions. [2025-03-16 19:32:07,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-16 19:32:07,489 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:07,489 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:07,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:32:07,490 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:07,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:07,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1768792955, now seen corresponding path program 1 times [2025-03-16 19:32:07,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:07,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323364377] [2025-03-16 19:32:07,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:07,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:07,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-16 19:32:07,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-16 19:32:07,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:07,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:07,645 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:32:07,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:07,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323364377] [2025-03-16 19:32:07,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323364377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:07,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:07,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:32:07,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104589538] [2025-03-16 19:32:07,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:07,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:32:07,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:07,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:32:07,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:32:07,649 INFO L87 Difference]: Start difference. First operand 293 states and 438 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:07,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:07,757 INFO L93 Difference]: Finished difference Result 762 states and 1171 transitions. [2025-03-16 19:32:07,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:32:07,758 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-16 19:32:07,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:07,761 INFO L225 Difference]: With dead ends: 762 [2025-03-16 19:32:07,761 INFO L226 Difference]: Without dead ends: 662 [2025-03-16 19:32:07,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:32:07,765 INFO L435 NwaCegarLoop]: 386 mSDtfsCounter, 512 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:07,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 1069 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:32:07,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2025-03-16 19:32:07,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 451. [2025-03-16 19:32:07,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 450 states have (on average 1.5266666666666666) internal successors, (687), 450 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:07,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 687 transitions. [2025-03-16 19:32:07,788 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 687 transitions. Word has length 63 [2025-03-16 19:32:07,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:07,789 INFO L471 AbstractCegarLoop]: Abstraction has 451 states and 687 transitions. [2025-03-16 19:32:07,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:07,789 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 687 transitions. [2025-03-16 19:32:07,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-16 19:32:07,790 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:07,790 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:07,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:32:07,791 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:07,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:07,793 INFO L85 PathProgramCache]: Analyzing trace with hash -466580083, now seen corresponding path program 1 times [2025-03-16 19:32:07,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:07,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644687839] [2025-03-16 19:32:07,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:07,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:07,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-16 19:32:07,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-16 19:32:07,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:07,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:07,930 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:32:07,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:07,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644687839] [2025-03-16 19:32:07,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644687839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:07,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:07,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:32:07,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995284093] [2025-03-16 19:32:07,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:07,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:32:07,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:07,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:32:07,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:32:07,932 INFO L87 Difference]: Start difference. First operand 451 states and 687 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:08,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:08,018 INFO L93 Difference]: Finished difference Result 866 states and 1335 transitions. [2025-03-16 19:32:08,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:32:08,019 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-16 19:32:08,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:08,022 INFO L225 Difference]: With dead ends: 866 [2025-03-16 19:32:08,022 INFO L226 Difference]: Without dead ends: 766 [2025-03-16 19:32:08,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:32:08,024 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 587 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:08,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 864 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:32:08,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2025-03-16 19:32:08,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 555. [2025-03-16 19:32:08,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 554 states have (on average 1.536101083032491) internal successors, (851), 554 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:08,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 851 transitions. [2025-03-16 19:32:08,042 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 851 transitions. Word has length 63 [2025-03-16 19:32:08,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:08,042 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 851 transitions. [2025-03-16 19:32:08,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:08,043 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 851 transitions. [2025-03-16 19:32:08,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-16 19:32:08,045 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:08,045 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:08,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:32:08,046 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:08,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:08,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1778334085, now seen corresponding path program 1 times [2025-03-16 19:32:08,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:08,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545512504] [2025-03-16 19:32:08,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:08,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:08,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-16 19:32:08,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-16 19:32:08,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:08,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:08,179 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:32:08,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:08,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545512504] [2025-03-16 19:32:08,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545512504] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:08,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:08,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:32:08,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331241979] [2025-03-16 19:32:08,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:08,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:32:08,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:08,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:32:08,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:32:08,182 INFO L87 Difference]: Start difference. First operand 555 states and 851 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:08,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:08,291 INFO L93 Difference]: Finished difference Result 965 states and 1491 transitions. [2025-03-16 19:32:08,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:32:08,292 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-16 19:32:08,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:08,295 INFO L225 Difference]: With dead ends: 965 [2025-03-16 19:32:08,295 INFO L226 Difference]: Without dead ends: 865 [2025-03-16 19:32:08,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:32:08,297 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 657 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:08,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 927 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:32:08,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2025-03-16 19:32:08,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 654. [2025-03-16 19:32:08,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 653 states have (on average 1.542113323124043) internal successors, (1007), 653 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:08,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 1007 transitions. [2025-03-16 19:32:08,314 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 1007 transitions. Word has length 63 [2025-03-16 19:32:08,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:08,315 INFO L471 AbstractCegarLoop]: Abstraction has 654 states and 1007 transitions. [2025-03-16 19:32:08,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:08,315 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 1007 transitions. [2025-03-16 19:32:08,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-16 19:32:08,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:08,316 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:08,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:32:08,316 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:08,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:08,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1242911086, now seen corresponding path program 1 times [2025-03-16 19:32:08,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:08,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058641844] [2025-03-16 19:32:08,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:08,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:08,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-16 19:32:08,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-16 19:32:08,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:08,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:08,374 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:32:08,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:08,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058641844] [2025-03-16 19:32:08,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058641844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:08,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:08,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:32:08,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945476030] [2025-03-16 19:32:08,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:08,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:32:08,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:08,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:32:08,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:32:08,378 INFO L87 Difference]: Start difference. First operand 654 states and 1007 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:08,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:08,401 INFO L93 Difference]: Finished difference Result 1665 states and 2590 transitions. [2025-03-16 19:32:08,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:32:08,401 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-16 19:32:08,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:08,406 INFO L225 Difference]: With dead ends: 1665 [2025-03-16 19:32:08,406 INFO L226 Difference]: Without dead ends: 1124 [2025-03-16 19:32:08,407 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:32:08,408 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 67 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 379 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:32:08,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 379 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:32:08,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2025-03-16 19:32:08,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 1122. [2025-03-16 19:32:08,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 1121 states have (on average 1.528099910793934) internal successors, (1713), 1121 states have internal predecessors, (1713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:08,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1713 transitions. [2025-03-16 19:32:08,439 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1713 transitions. Word has length 63 [2025-03-16 19:32:08,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:08,439 INFO L471 AbstractCegarLoop]: Abstraction has 1122 states and 1713 transitions. [2025-03-16 19:32:08,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:08,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1713 transitions. [2025-03-16 19:32:08,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-16 19:32:08,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:08,440 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:08,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:32:08,441 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:08,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:08,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1241749237, now seen corresponding path program 1 times [2025-03-16 19:32:08,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:08,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823707902] [2025-03-16 19:32:08,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:08,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:08,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-16 19:32:08,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-16 19:32:08,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:08,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:08,632 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:32:08,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:08,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823707902] [2025-03-16 19:32:08,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823707902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:08,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:08,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:32:08,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8271972] [2025-03-16 19:32:08,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:08,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:32:08,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:08,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:32:08,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:32:08,635 INFO L87 Difference]: Start difference. First operand 1122 states and 1713 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:08,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:08,727 INFO L93 Difference]: Finished difference Result 2133 states and 3274 transitions. [2025-03-16 19:32:08,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:32:08,727 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-16 19:32:08,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:08,730 INFO L225 Difference]: With dead ends: 2133 [2025-03-16 19:32:08,730 INFO L226 Difference]: Without dead ends: 1124 [2025-03-16 19:32:08,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:32:08,732 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 294 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:08,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 447 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:32:08,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2025-03-16 19:32:08,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 1122. [2025-03-16 19:32:08,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 1121 states have (on average 1.5227475468331846) internal successors, (1707), 1121 states have internal predecessors, (1707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:08,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1707 transitions. [2025-03-16 19:32:08,754 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1707 transitions. Word has length 63 [2025-03-16 19:32:08,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:08,754 INFO L471 AbstractCegarLoop]: Abstraction has 1122 states and 1707 transitions. [2025-03-16 19:32:08,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:08,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1707 transitions. [2025-03-16 19:32:08,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-16 19:32:08,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:08,755 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:08,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:32:08,755 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:08,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:08,755 INFO L85 PathProgramCache]: Analyzing trace with hash 129233768, now seen corresponding path program 1 times [2025-03-16 19:32:08,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:08,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76139606] [2025-03-16 19:32:08,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:08,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:08,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-16 19:32:08,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-16 19:32:08,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:08,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:08,833 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:32:08,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:08,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76139606] [2025-03-16 19:32:08,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76139606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:08,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:08,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:32:08,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721965075] [2025-03-16 19:32:08,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:08,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:32:08,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:08,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:32:08,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:32:08,835 INFO L87 Difference]: Start difference. First operand 1122 states and 1707 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:08,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:08,932 INFO L93 Difference]: Finished difference Result 2215 states and 3384 transitions. [2025-03-16 19:32:08,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:32:08,932 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-16 19:32:08,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:08,936 INFO L225 Difference]: With dead ends: 2215 [2025-03-16 19:32:08,936 INFO L226 Difference]: Without dead ends: 1122 [2025-03-16 19:32:08,937 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:32:08,938 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 451 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:08,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 88 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:32:08,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2025-03-16 19:32:08,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 1122. [2025-03-16 19:32:08,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 1121 states have (on average 1.5022301516503123) internal successors, (1684), 1121 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:08,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1684 transitions. [2025-03-16 19:32:08,959 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1684 transitions. Word has length 64 [2025-03-16 19:32:08,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:08,959 INFO L471 AbstractCegarLoop]: Abstraction has 1122 states and 1684 transitions. [2025-03-16 19:32:08,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:08,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1684 transitions. [2025-03-16 19:32:08,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-16 19:32:08,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:08,962 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:08,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:32:08,962 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:08,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:08,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1407953313, now seen corresponding path program 1 times [2025-03-16 19:32:08,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:08,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475249109] [2025-03-16 19:32:08,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:08,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:08,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-16 19:32:08,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-16 19:32:08,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:08,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:09,074 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:32:09,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:09,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475249109] [2025-03-16 19:32:09,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475249109] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:09,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:09,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:32:09,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041968485] [2025-03-16 19:32:09,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:09,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:32:09,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:09,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:32:09,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:32:09,076 INFO L87 Difference]: Start difference. First operand 1122 states and 1684 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:09,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:09,162 INFO L93 Difference]: Finished difference Result 2203 states and 3324 transitions. [2025-03-16 19:32:09,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:32:09,162 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-16 19:32:09,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:09,165 INFO L225 Difference]: With dead ends: 2203 [2025-03-16 19:32:09,165 INFO L226 Difference]: Without dead ends: 1122 [2025-03-16 19:32:09,167 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:32:09,169 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 411 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:09,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 112 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:32:09,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2025-03-16 19:32:09,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 1122. [2025-03-16 19:32:09,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 1121 states have (on average 1.4817127564674397) internal successors, (1661), 1121 states have internal predecessors, (1661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:09,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1661 transitions. [2025-03-16 19:32:09,190 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1661 transitions. Word has length 65 [2025-03-16 19:32:09,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:09,190 INFO L471 AbstractCegarLoop]: Abstraction has 1122 states and 1661 transitions. [2025-03-16 19:32:09,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:09,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1661 transitions. [2025-03-16 19:32:09,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 19:32:09,191 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:09,192 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:09,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:32:09,192 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:09,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:09,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1224775892, now seen corresponding path program 1 times [2025-03-16 19:32:09,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:09,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988825678] [2025-03-16 19:32:09,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:09,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:09,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 19:32:09,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 19:32:09,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:09,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:09,271 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:32:09,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:09,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988825678] [2025-03-16 19:32:09,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988825678] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:09,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:09,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:32:09,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011195864] [2025-03-16 19:32:09,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:09,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:32:09,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:09,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:32:09,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:32:09,273 INFO L87 Difference]: Start difference. First operand 1122 states and 1661 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:09,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:09,359 INFO L93 Difference]: Finished difference Result 2211 states and 3288 transitions. [2025-03-16 19:32:09,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:32:09,360 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-16 19:32:09,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:09,363 INFO L225 Difference]: With dead ends: 2211 [2025-03-16 19:32:09,363 INFO L226 Difference]: Without dead ends: 1122 [2025-03-16 19:32:09,364 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:32:09,364 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 427 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:09,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 96 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:32:09,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2025-03-16 19:32:09,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 1122. [2025-03-16 19:32:09,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 1121 states have (on average 1.4611953612845674) internal successors, (1638), 1121 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:09,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1638 transitions. [2025-03-16 19:32:09,385 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1638 transitions. Word has length 66 [2025-03-16 19:32:09,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:09,385 INFO L471 AbstractCegarLoop]: Abstraction has 1122 states and 1638 transitions. [2025-03-16 19:32:09,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:09,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1638 transitions. [2025-03-16 19:32:09,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-16 19:32:09,386 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:09,386 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:09,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:32:09,387 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:09,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:09,387 INFO L85 PathProgramCache]: Analyzing trace with hash -23213951, now seen corresponding path program 1 times [2025-03-16 19:32:09,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:09,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593409884] [2025-03-16 19:32:09,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:09,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:09,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-16 19:32:09,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-16 19:32:09,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:09,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:09,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:32:09,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:09,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593409884] [2025-03-16 19:32:09,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593409884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:09,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:09,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:32:09,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697700232] [2025-03-16 19:32:09,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:09,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:32:09,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:09,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:32:09,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:32:09,482 INFO L87 Difference]: Start difference. First operand 1122 states and 1638 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:09,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:09,566 INFO L93 Difference]: Finished difference Result 2207 states and 3238 transitions. [2025-03-16 19:32:09,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:32:09,566 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-16 19:32:09,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:09,569 INFO L225 Difference]: With dead ends: 2207 [2025-03-16 19:32:09,569 INFO L226 Difference]: Without dead ends: 1122 [2025-03-16 19:32:09,570 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:32:09,571 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 409 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:09,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 104 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:32:09,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2025-03-16 19:32:09,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 1122. [2025-03-16 19:32:09,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 1121 states have (on average 1.4406779661016949) internal successors, (1615), 1121 states have internal predecessors, (1615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:09,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1615 transitions. [2025-03-16 19:32:09,587 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1615 transitions. Word has length 67 [2025-03-16 19:32:09,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:09,587 INFO L471 AbstractCegarLoop]: Abstraction has 1122 states and 1615 transitions. [2025-03-16 19:32:09,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:09,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1615 transitions. [2025-03-16 19:32:09,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-16 19:32:09,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:09,589 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:09,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:32:09,590 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:09,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:09,590 INFO L85 PathProgramCache]: Analyzing trace with hash 956537328, now seen corresponding path program 1 times [2025-03-16 19:32:09,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:09,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124548857] [2025-03-16 19:32:09,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:09,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:09,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 19:32:09,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 19:32:09,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:09,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:09,799 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:32:09,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:09,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124548857] [2025-03-16 19:32:09,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124548857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:09,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:09,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:32:09,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870872070] [2025-03-16 19:32:09,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:09,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:32:09,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:09,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:32:09,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:32:09,801 INFO L87 Difference]: Start difference. First operand 1122 states and 1615 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:10,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:10,066 INFO L93 Difference]: Finished difference Result 3185 states and 4613 transitions. [2025-03-16 19:32:10,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:32:10,067 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-16 19:32:10,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:10,072 INFO L225 Difference]: With dead ends: 3185 [2025-03-16 19:32:10,072 INFO L226 Difference]: Without dead ends: 2136 [2025-03-16 19:32:10,074 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:32:10,074 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 570 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:10,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 359 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:32:10,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2136 states. [2025-03-16 19:32:10,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2136 to 1122. [2025-03-16 19:32:10,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 1121 states have (on average 1.43978590544157) internal successors, (1614), 1121 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:10,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1614 transitions. [2025-03-16 19:32:10,098 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1614 transitions. Word has length 68 [2025-03-16 19:32:10,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:10,098 INFO L471 AbstractCegarLoop]: Abstraction has 1122 states and 1614 transitions. [2025-03-16 19:32:10,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:10,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1614 transitions. [2025-03-16 19:32:10,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-16 19:32:10,099 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:10,099 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:10,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:32:10,099 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:10,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:10,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1424602330, now seen corresponding path program 1 times [2025-03-16 19:32:10,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:10,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126724513] [2025-03-16 19:32:10,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:10,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:10,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-16 19:32:10,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 19:32:10,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:10,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:10,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:32:10,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:10,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126724513] [2025-03-16 19:32:10,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126724513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:10,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:10,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:32:10,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498153003] [2025-03-16 19:32:10,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:10,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:32:10,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:10,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:32:10,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:32:10,198 INFO L87 Difference]: Start difference. First operand 1122 states and 1614 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:10,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:10,223 INFO L93 Difference]: Finished difference Result 2612 states and 3781 transitions. [2025-03-16 19:32:10,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:32:10,224 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-16 19:32:10,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:10,228 INFO L225 Difference]: With dead ends: 2612 [2025-03-16 19:32:10,228 INFO L226 Difference]: Without dead ends: 1603 [2025-03-16 19:32:10,229 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:32:10,230 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 80 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 413 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:32:10,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 413 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:32:10,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2025-03-16 19:32:10,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1601. [2025-03-16 19:32:10,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1601 states, 1600 states have (on average 1.435625) internal successors, (2297), 1600 states have internal predecessors, (2297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:10,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2297 transitions. [2025-03-16 19:32:10,254 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2297 transitions. Word has length 69 [2025-03-16 19:32:10,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:10,254 INFO L471 AbstractCegarLoop]: Abstraction has 1601 states and 2297 transitions. [2025-03-16 19:32:10,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:10,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2297 transitions. [2025-03-16 19:32:10,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-16 19:32:10,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:10,255 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:10,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:32:10,256 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:10,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:10,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1456806401, now seen corresponding path program 1 times [2025-03-16 19:32:10,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:10,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722090220] [2025-03-16 19:32:10,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:10,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:10,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-16 19:32:10,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 19:32:10,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:10,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:10,428 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:32:10,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:10,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722090220] [2025-03-16 19:32:10,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722090220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:10,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:10,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:32:10,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007376871] [2025-03-16 19:32:10,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:10,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:32:10,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:10,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:32:10,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:32:10,430 INFO L87 Difference]: Start difference. First operand 1601 states and 2297 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:10,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:10,454 INFO L93 Difference]: Finished difference Result 1613 states and 2313 transitions. [2025-03-16 19:32:10,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:32:10,455 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-16 19:32:10,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:10,460 INFO L225 Difference]: With dead ends: 1613 [2025-03-16 19:32:10,460 INFO L226 Difference]: Without dead ends: 1611 [2025-03-16 19:32:10,461 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:32:10,461 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 593 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:32:10,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 593 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:32:10,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2025-03-16 19:32:10,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1611. [2025-03-16 19:32:10,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1611 states, 1610 states have (on average 1.4254658385093169) internal successors, (2295), 1610 states have internal predecessors, (2295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:10,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 2295 transitions. [2025-03-16 19:32:10,486 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 2295 transitions. Word has length 69 [2025-03-16 19:32:10,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:10,487 INFO L471 AbstractCegarLoop]: Abstraction has 1611 states and 2295 transitions. [2025-03-16 19:32:10,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:10,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2295 transitions. [2025-03-16 19:32:10,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-16 19:32:10,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:10,487 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:10,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:32:10,488 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:10,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:10,488 INFO L85 PathProgramCache]: Analyzing trace with hash -422719871, now seen corresponding path program 1 times [2025-03-16 19:32:10,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:10,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521078765] [2025-03-16 19:32:10,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:10,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:10,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-16 19:32:10,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 19:32:10,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:10,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:10,696 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:32:10,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:10,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521078765] [2025-03-16 19:32:10,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521078765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:10,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:10,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:32:10,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182856883] [2025-03-16 19:32:10,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:10,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:32:10,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:10,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:32:10,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:32:10,699 INFO L87 Difference]: Start difference. First operand 1611 states and 2295 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:11,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:11,019 INFO L93 Difference]: Finished difference Result 4733 states and 6745 transitions. [2025-03-16 19:32:11,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:32:11,019 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-16 19:32:11,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:11,027 INFO L225 Difference]: With dead ends: 4733 [2025-03-16 19:32:11,027 INFO L226 Difference]: Without dead ends: 3210 [2025-03-16 19:32:11,029 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:32:11,029 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 653 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:11,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 399 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:32:11,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3210 states. [2025-03-16 19:32:11,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3210 to 1611. [2025-03-16 19:32:11,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1611 states, 1610 states have (on average 1.4229813664596274) internal successors, (2291), 1610 states have internal predecessors, (2291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:11,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 2291 transitions. [2025-03-16 19:32:11,068 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 2291 transitions. Word has length 69 [2025-03-16 19:32:11,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:11,068 INFO L471 AbstractCegarLoop]: Abstraction has 1611 states and 2291 transitions. [2025-03-16 19:32:11,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:11,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2291 transitions. [2025-03-16 19:32:11,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-16 19:32:11,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:11,069 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:11,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:32:11,069 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:11,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:11,069 INFO L85 PathProgramCache]: Analyzing trace with hash 879493001, now seen corresponding path program 1 times [2025-03-16 19:32:11,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:11,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687138046] [2025-03-16 19:32:11,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:11,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:11,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-16 19:32:11,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 19:32:11,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:11,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:11,423 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:32:11,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:11,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687138046] [2025-03-16 19:32:11,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687138046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:11,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:11,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 19:32:11,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254335097] [2025-03-16 19:32:11,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:11,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 19:32:11,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:11,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 19:32:11,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:32:11,425 INFO L87 Difference]: Start difference. First operand 1611 states and 2291 transitions. Second operand has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:11,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:11,928 INFO L93 Difference]: Finished difference Result 4796 states and 6796 transitions. [2025-03-16 19:32:11,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-16 19:32:11,929 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-16 19:32:11,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:11,936 INFO L225 Difference]: With dead ends: 4796 [2025-03-16 19:32:11,937 INFO L226 Difference]: Without dead ends: 3294 [2025-03-16 19:32:11,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2025-03-16 19:32:11,939 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 563 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:11,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 523 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:32:11,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3294 states. [2025-03-16 19:32:11,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3294 to 1633. [2025-03-16 19:32:11,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1633 states, 1632 states have (on average 1.4197303921568627) internal successors, (2317), 1632 states have internal predecessors, (2317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:11,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1633 states to 1633 states and 2317 transitions. [2025-03-16 19:32:11,969 INFO L78 Accepts]: Start accepts. Automaton has 1633 states and 2317 transitions. Word has length 69 [2025-03-16 19:32:11,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:11,970 INFO L471 AbstractCegarLoop]: Abstraction has 1633 states and 2317 transitions. [2025-03-16 19:32:11,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:11,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1633 states and 2317 transitions. [2025-03-16 19:32:11,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-16 19:32:11,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:11,970 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:11,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:32:11,971 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:11,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:11,971 INFO L85 PathProgramCache]: Analyzing trace with hash -980912681, now seen corresponding path program 1 times [2025-03-16 19:32:11,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:11,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045525980] [2025-03-16 19:32:11,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:11,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:11,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-16 19:32:12,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-16 19:32:12,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:12,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:12,216 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:32:12,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:12,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045525980] [2025-03-16 19:32:12,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045525980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:12,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:12,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:32:12,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285066310] [2025-03-16 19:32:12,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:12,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:32:12,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:12,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:32:12,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:32:12,218 INFO L87 Difference]: Start difference. First operand 1633 states and 2317 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:12,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:12,627 INFO L93 Difference]: Finished difference Result 4731 states and 6725 transitions. [2025-03-16 19:32:12,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:32:12,628 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-16 19:32:12,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:12,640 INFO L225 Difference]: With dead ends: 4731 [2025-03-16 19:32:12,641 INFO L226 Difference]: Without dead ends: 3228 [2025-03-16 19:32:12,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2025-03-16 19:32:12,644 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 599 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:12,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 425 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:32:12,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3228 states. [2025-03-16 19:32:12,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3228 to 1611. [2025-03-16 19:32:12,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1611 states, 1610 states have (on average 1.4198757763975156) internal successors, (2286), 1610 states have internal predecessors, (2286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:12,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 2286 transitions. [2025-03-16 19:32:12,687 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 2286 transitions. Word has length 70 [2025-03-16 19:32:12,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:12,687 INFO L471 AbstractCegarLoop]: Abstraction has 1611 states and 2286 transitions. [2025-03-16 19:32:12,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:12,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2286 transitions. [2025-03-16 19:32:12,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-16 19:32:12,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:12,688 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:12,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:32:12,689 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:12,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:12,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1439878953, now seen corresponding path program 1 times [2025-03-16 19:32:12,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:12,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341532837] [2025-03-16 19:32:12,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:12,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:12,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-16 19:32:12,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-16 19:32:12,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:12,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:12,911 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:32:12,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:12,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341532837] [2025-03-16 19:32:12,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341532837] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:12,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:12,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:32:12,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679930410] [2025-03-16 19:32:12,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:12,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:32:12,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:12,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:32:12,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:32:12,913 INFO L87 Difference]: Start difference. First operand 1611 states and 2286 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:13,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:13,338 INFO L93 Difference]: Finished difference Result 4659 states and 6623 transitions. [2025-03-16 19:32:13,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:32:13,339 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-16 19:32:13,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:13,349 INFO L225 Difference]: With dead ends: 4659 [2025-03-16 19:32:13,349 INFO L226 Difference]: Without dead ends: 3126 [2025-03-16 19:32:13,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-03-16 19:32:13,354 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 322 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:13,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 651 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:32:13,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3126 states. [2025-03-16 19:32:13,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3126 to 1611. [2025-03-16 19:32:13,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1611 states, 1610 states have (on average 1.4186335403726709) internal successors, (2284), 1610 states have internal predecessors, (2284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:13,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 2284 transitions. [2025-03-16 19:32:13,384 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 2284 transitions. Word has length 70 [2025-03-16 19:32:13,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:13,384 INFO L471 AbstractCegarLoop]: Abstraction has 1611 states and 2284 transitions. [2025-03-16 19:32:13,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:13,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2284 transitions. [2025-03-16 19:32:13,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 19:32:13,385 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:13,385 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:13,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:32:13,385 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:13,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:13,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1167006695, now seen corresponding path program 1 times [2025-03-16 19:32:13,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:13,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039089100] [2025-03-16 19:32:13,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:13,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:13,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 19:32:13,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 19:32:13,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:13,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:14,386 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:32:14,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:14,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039089100] [2025-03-16 19:32:14,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039089100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:14,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:14,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2025-03-16 19:32:14,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289210791] [2025-03-16 19:32:14,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:14,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-16 19:32:14,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:14,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-16 19:32:14,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=645, Unknown=0, NotChecked=0, Total=702 [2025-03-16 19:32:14,387 INFO L87 Difference]: Start difference. First operand 1611 states and 2284 transitions. Second operand has 27 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 26 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:16,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:16,829 INFO L93 Difference]: Finished difference Result 8179 states and 11688 transitions. [2025-03-16 19:32:16,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-16 19:32:16,830 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 26 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-03-16 19:32:16,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:16,840 INFO L225 Difference]: With dead ends: 8179 [2025-03-16 19:32:16,840 INFO L226 Difference]: Without dead ends: 7631 [2025-03-16 19:32:16,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=340, Invalid=2012, Unknown=0, NotChecked=0, Total=2352 [2025-03-16 19:32:16,842 INFO L435 NwaCegarLoop]: 306 mSDtfsCounter, 1113 mSDsluCounter, 4773 mSDsCounter, 0 mSdLazyCounter, 3483 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1113 SdHoareTripleChecker+Valid, 5079 SdHoareTripleChecker+Invalid, 3485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:16,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1113 Valid, 5079 Invalid, 3485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3483 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 19:32:16,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7631 states. [2025-03-16 19:32:16,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7631 to 1636. [2025-03-16 19:32:16,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1636 states, 1635 states have (on average 1.415902140672783) internal successors, (2315), 1635 states have internal predecessors, (2315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:16,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 2315 transitions. [2025-03-16 19:32:16,886 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 2315 transitions. Word has length 71 [2025-03-16 19:32:16,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:16,887 INFO L471 AbstractCegarLoop]: Abstraction has 1636 states and 2315 transitions. [2025-03-16 19:32:16,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 26 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:16,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 2315 transitions. [2025-03-16 19:32:16,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 19:32:16,888 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:16,888 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:16,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 19:32:16,889 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:16,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:16,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1973816129, now seen corresponding path program 1 times [2025-03-16 19:32:16,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:16,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805459704] [2025-03-16 19:32:16,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:16,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:16,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 19:32:16,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 19:32:16,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:16,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:17,316 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:32:17,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:17,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805459704] [2025-03-16 19:32:17,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805459704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:17,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:17,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 19:32:17,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594716104] [2025-03-16 19:32:17,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:17,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 19:32:17,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:17,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 19:32:17,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:32:17,318 INFO L87 Difference]: Start difference. First operand 1636 states and 2315 transitions. Second operand has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:17,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:17,817 INFO L93 Difference]: Finished difference Result 3705 states and 5279 transitions. [2025-03-16 19:32:17,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 19:32:17,818 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-03-16 19:32:17,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:17,822 INFO L225 Difference]: With dead ends: 3705 [2025-03-16 19:32:17,822 INFO L226 Difference]: Without dead ends: 3157 [2025-03-16 19:32:17,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=143, Invalid=457, Unknown=0, NotChecked=0, Total=600 [2025-03-16 19:32:17,823 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 536 mSDsluCounter, 1101 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:17,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 1290 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:32:17,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3157 states. [2025-03-16 19:32:17,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3157 to 1633. [2025-03-16 19:32:17,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1633 states, 1632 states have (on average 1.4136029411764706) internal successors, (2307), 1632 states have internal predecessors, (2307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:17,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1633 states to 1633 states and 2307 transitions. [2025-03-16 19:32:17,852 INFO L78 Accepts]: Start accepts. Automaton has 1633 states and 2307 transitions. Word has length 71 [2025-03-16 19:32:17,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:17,852 INFO L471 AbstractCegarLoop]: Abstraction has 1633 states and 2307 transitions. [2025-03-16 19:32:17,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:17,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1633 states and 2307 transitions. [2025-03-16 19:32:17,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 19:32:17,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:17,853 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:17,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 19:32:17,853 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:17,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:17,854 INFO L85 PathProgramCache]: Analyzing trace with hash 231942937, now seen corresponding path program 1 times [2025-03-16 19:32:17,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:17,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184320498] [2025-03-16 19:32:17,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:17,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:17,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 19:32:17,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 19:32:17,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:17,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:18,276 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:32:18,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:18,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184320498] [2025-03-16 19:32:18,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184320498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:18,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:18,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 19:32:18,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304185118] [2025-03-16 19:32:18,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:18,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 19:32:18,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:18,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 19:32:18,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:32:18,278 INFO L87 Difference]: Start difference. First operand 1633 states and 2307 transitions. Second operand has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:18,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:18,729 INFO L93 Difference]: Finished difference Result 3613 states and 5143 transitions. [2025-03-16 19:32:18,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 19:32:18,729 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-03-16 19:32:18,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:18,733 INFO L225 Difference]: With dead ends: 3613 [2025-03-16 19:32:18,733 INFO L226 Difference]: Without dead ends: 3036 [2025-03-16 19:32:18,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-03-16 19:32:18,734 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 704 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:18,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 914 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:32:18,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3036 states. [2025-03-16 19:32:18,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3036 to 1607. [2025-03-16 19:32:18,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1607 states, 1606 states have (on average 1.4140722291407224) internal successors, (2271), 1606 states have internal predecessors, (2271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:18,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1607 states to 1607 states and 2271 transitions. [2025-03-16 19:32:18,752 INFO L78 Accepts]: Start accepts. Automaton has 1607 states and 2271 transitions. Word has length 71 [2025-03-16 19:32:18,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:18,752 INFO L471 AbstractCegarLoop]: Abstraction has 1607 states and 2271 transitions. [2025-03-16 19:32:18,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:18,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1607 states and 2271 transitions. [2025-03-16 19:32:18,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 19:32:18,753 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:18,753 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:18,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 19:32:18,753 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:18,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:18,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1313898049, now seen corresponding path program 1 times [2025-03-16 19:32:18,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:18,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191383406] [2025-03-16 19:32:18,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:18,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:18,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 19:32:18,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 19:32:18,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:18,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:19,074 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:32:19,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:19,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191383406] [2025-03-16 19:32:19,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191383406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:19,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:19,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 19:32:19,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942705218] [2025-03-16 19:32:19,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:19,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 19:32:19,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:19,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 19:32:19,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:32:19,075 INFO L87 Difference]: Start difference. First operand 1607 states and 2271 transitions. Second operand has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:19,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:19,489 INFO L93 Difference]: Finished difference Result 6321 states and 9030 transitions. [2025-03-16 19:32:19,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:32:19,489 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-03-16 19:32:19,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:19,496 INFO L225 Difference]: With dead ends: 6321 [2025-03-16 19:32:19,496 INFO L226 Difference]: Without dead ends: 5753 [2025-03-16 19:32:19,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2025-03-16 19:32:19,498 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 713 mSDsluCounter, 1619 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 1954 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:19,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 1954 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:32:19,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5753 states. [2025-03-16 19:32:19,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5753 to 1498. [2025-03-16 19:32:19,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1498 states, 1497 states have (on average 1.4161656646626586) internal successors, (2120), 1497 states have internal predecessors, (2120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:19,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1498 states to 1498 states and 2120 transitions. [2025-03-16 19:32:19,525 INFO L78 Accepts]: Start accepts. Automaton has 1498 states and 2120 transitions. Word has length 71 [2025-03-16 19:32:19,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:19,526 INFO L471 AbstractCegarLoop]: Abstraction has 1498 states and 2120 transitions. [2025-03-16 19:32:19,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:19,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1498 states and 2120 transitions. [2025-03-16 19:32:19,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-16 19:32:19,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:19,526 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:19,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 19:32:19,527 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:19,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:19,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1833999193, now seen corresponding path program 1 times [2025-03-16 19:32:19,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:19,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993324637] [2025-03-16 19:32:19,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:19,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:19,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 19:32:19,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 19:32:19,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:19,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:19,900 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:32:19,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:19,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993324637] [2025-03-16 19:32:19,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993324637] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:19,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:19,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 19:32:19,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105126633] [2025-03-16 19:32:19,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:19,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 19:32:19,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:19,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 19:32:19,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:32:19,901 INFO L87 Difference]: Start difference. First operand 1498 states and 2120 transitions. Second operand has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 12 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:20,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:20,404 INFO L93 Difference]: Finished difference Result 3466 states and 4942 transitions. [2025-03-16 19:32:20,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 19:32:20,404 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 12 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-03-16 19:32:20,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:20,408 INFO L225 Difference]: With dead ends: 3466 [2025-03-16 19:32:20,408 INFO L226 Difference]: Without dead ends: 2910 [2025-03-16 19:32:20,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-03-16 19:32:20,409 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 537 mSDsluCounter, 1148 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 1341 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:20,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [537 Valid, 1341 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:32:20,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2910 states. [2025-03-16 19:32:20,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2910 to 1479. [2025-03-16 19:32:20,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1479 states, 1478 states have (on average 1.4181326116373478) internal successors, (2096), 1478 states have internal predecessors, (2096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:20,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 1479 states and 2096 transitions. [2025-03-16 19:32:20,423 INFO L78 Accepts]: Start accepts. Automaton has 1479 states and 2096 transitions. Word has length 73 [2025-03-16 19:32:20,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:20,424 INFO L471 AbstractCegarLoop]: Abstraction has 1479 states and 2096 transitions. [2025-03-16 19:32:20,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 12 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:20,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1479 states and 2096 transitions. [2025-03-16 19:32:20,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-16 19:32:20,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:20,425 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] [2025-03-16 19:32:20,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 19:32:20,425 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:20,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:20,425 INFO L85 PathProgramCache]: Analyzing trace with hash -486138097, now seen corresponding path program 1 times [2025-03-16 19:32:20,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:20,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520366933] [2025-03-16 19:32:20,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:20,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:20,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-16 19:32:20,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-16 19:32:20,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:20,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:20,487 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:32:20,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:20,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520366933] [2025-03-16 19:32:20,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520366933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:20,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:20,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:32:20,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027634055] [2025-03-16 19:32:20,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:20,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:32:20,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:20,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:32:20,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:32:20,489 INFO L87 Difference]: Start difference. First operand 1479 states and 2096 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 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:32:20,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:20,502 INFO L93 Difference]: Finished difference Result 3112 states and 4434 transitions. [2025-03-16 19:32:20,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:32:20,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 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:32:20,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:20,505 INFO L225 Difference]: With dead ends: 3112 [2025-03-16 19:32:20,506 INFO L226 Difference]: Without dead ends: 2093 [2025-03-16 19:32:20,506 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:32:20,507 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 65 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 317 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:32:20,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 317 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:32:20,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2093 states. [2025-03-16 19:32:20,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2093 to 1999. [2025-03-16 19:32:20,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1999 states, 1998 states have (on average 1.4139139139139139) internal successors, (2825), 1998 states have internal predecessors, (2825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:20,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1999 states to 1999 states and 2825 transitions. [2025-03-16 19:32:20,523 INFO L78 Accepts]: Start accepts. Automaton has 1999 states and 2825 transitions. Word has length 96 [2025-03-16 19:32:20,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:20,524 INFO L471 AbstractCegarLoop]: Abstraction has 1999 states and 2825 transitions. [2025-03-16 19:32:20,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 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:32:20,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1999 states and 2825 transitions. [2025-03-16 19:32:20,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-16 19:32:20,524 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:20,524 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] [2025-03-16 19:32:20,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 19:32:20,525 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:20,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:20,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1893763119, now seen corresponding path program 1 times [2025-03-16 19:32:20,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:20,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252815008] [2025-03-16 19:32:20,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:20,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:20,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-16 19:32:20,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-16 19:32:20,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:20,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:20,611 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:32:20,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:20,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252815008] [2025-03-16 19:32:20,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252815008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:20,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:20,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:32:20,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690302332] [2025-03-16 19:32:20,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:20,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:32:20,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:20,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:32:20,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:32:20,613 INFO L87 Difference]: Start difference. First operand 1999 states and 2825 transitions. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 6 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:32:20,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:20,798 INFO L93 Difference]: Finished difference Result 5104 states and 7309 transitions. [2025-03-16 19:32:20,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:32:20,798 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 6 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:32:20,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:20,802 INFO L225 Difference]: With dead ends: 5104 [2025-03-16 19:32:20,802 INFO L226 Difference]: Without dead ends: 3182 [2025-03-16 19:32:20,804 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:32:20,804 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 689 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:20,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 319 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:32:20,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3182 states. [2025-03-16 19:32:20,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3182 to 2206. [2025-03-16 19:32:20,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2206 states, 2205 states have (on average 1.4063492063492065) internal successors, (3101), 2205 states have internal predecessors, (3101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:20,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2206 states to 2206 states and 3101 transitions. [2025-03-16 19:32:20,824 INFO L78 Accepts]: Start accepts. Automaton has 2206 states and 3101 transitions. Word has length 98 [2025-03-16 19:32:20,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:20,824 INFO L471 AbstractCegarLoop]: Abstraction has 2206 states and 3101 transitions. [2025-03-16 19:32:20,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 6 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:32:20,824 INFO L276 IsEmpty]: Start isEmpty. Operand 2206 states and 3101 transitions. [2025-03-16 19:32:20,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-16 19:32:20,825 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:20,825 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] [2025-03-16 19:32:20,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 19:32:20,825 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:20,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:20,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1239325967, now seen corresponding path program 1 times [2025-03-16 19:32:20,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:20,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091312723] [2025-03-16 19:32:20,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:20,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:20,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-16 19:32:20,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-16 19:32:20,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:20,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:20,904 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:32:20,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:20,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091312723] [2025-03-16 19:32:20,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091312723] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:20,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:20,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:32:20,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227528498] [2025-03-16 19:32:20,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:20,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:32:20,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:20,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:32:20,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:32:20,905 INFO L87 Difference]: Start difference. First operand 2206 states and 3101 transitions. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 6 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:32:21,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:21,081 INFO L93 Difference]: Finished difference Result 8126 states and 11637 transitions. [2025-03-16 19:32:21,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:32:21,081 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 6 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:32:21,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:21,087 INFO L225 Difference]: With dead ends: 8126 [2025-03-16 19:32:21,087 INFO L226 Difference]: Without dead ends: 6006 [2025-03-16 19:32:21,089 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:32:21,090 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 789 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:21,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 269 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:32:21,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6006 states. [2025-03-16 19:32:21,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6006 to 4744. [2025-03-16 19:32:21,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4744 states, 4743 states have (on average 1.411764705882353) internal successors, (6696), 4743 states have internal predecessors, (6696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:21,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4744 states to 4744 states and 6696 transitions. [2025-03-16 19:32:21,131 INFO L78 Accepts]: Start accepts. Automaton has 4744 states and 6696 transitions. Word has length 98 [2025-03-16 19:32:21,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:21,131 INFO L471 AbstractCegarLoop]: Abstraction has 4744 states and 6696 transitions. [2025-03-16 19:32:21,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 6 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:32:21,132 INFO L276 IsEmpty]: Start isEmpty. Operand 4744 states and 6696 transitions. [2025-03-16 19:32:21,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-16 19:32:21,132 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:21,132 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] [2025-03-16 19:32:21,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-16 19:32:21,132 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:21,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:21,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1805129043, now seen corresponding path program 1 times [2025-03-16 19:32:21,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:21,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456674161] [2025-03-16 19:32:21,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:21,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:21,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-16 19:32:21,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-16 19:32:21,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:21,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:21,219 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:32:21,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:21,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456674161] [2025-03-16 19:32:21,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456674161] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:21,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:21,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:32:21,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424908978] [2025-03-16 19:32:21,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:21,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:32:21,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:21,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:32:21,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:32:21,221 INFO L87 Difference]: Start difference. First operand 4744 states and 6696 transitions. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 6 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:32:21,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:21,404 INFO L93 Difference]: Finished difference Result 15740 states and 22422 transitions. [2025-03-16 19:32:21,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:32:21,404 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 6 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:32:21,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:21,415 INFO L225 Difference]: With dead ends: 15740 [2025-03-16 19:32:21,415 INFO L226 Difference]: Without dead ends: 11082 [2025-03-16 19:32:21,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:32:21,420 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 704 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:21,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 267 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:32:21,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11082 states. [2025-03-16 19:32:21,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11082 to 10240. [2025-03-16 19:32:21,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10240 states, 10239 states have (on average 1.4136146108018361) internal successors, (14474), 10239 states have internal predecessors, (14474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:21,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10240 states to 10240 states and 14474 transitions. [2025-03-16 19:32:21,509 INFO L78 Accepts]: Start accepts. Automaton has 10240 states and 14474 transitions. Word has length 98 [2025-03-16 19:32:21,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:21,509 INFO L471 AbstractCegarLoop]: Abstraction has 10240 states and 14474 transitions. [2025-03-16 19:32:21,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 6 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:32:21,509 INFO L276 IsEmpty]: Start isEmpty. Operand 10240 states and 14474 transitions. [2025-03-16 19:32:21,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 19:32:21,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:21,511 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:21,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-16 19:32:21,511 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:21,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:21,511 INFO L85 PathProgramCache]: Analyzing trace with hash -446798535, now seen corresponding path program 1 times [2025-03-16 19:32:21,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:21,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421658507] [2025-03-16 19:32:21,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:21,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:21,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 19:32:21,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 19:32:21,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:21,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:21,589 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-16 19:32:21,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:21,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421658507] [2025-03-16 19:32:21,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421658507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:21,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:21,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:32:21,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991709373] [2025-03-16 19:32:21,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:21,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:32:21,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:21,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:32:21,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:32:21,592 INFO L87 Difference]: Start difference. First operand 10240 states and 14474 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:21,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:21,627 INFO L93 Difference]: Finished difference Result 19508 states and 27504 transitions. [2025-03-16 19:32:21,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:32:21,627 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2025-03-16 19:32:21,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:21,636 INFO L225 Difference]: With dead ends: 19508 [2025-03-16 19:32:21,636 INFO L226 Difference]: Without dead ends: 9351 [2025-03-16 19:32:21,644 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:32:21,645 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 58 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 308 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:32:21,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 308 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:32:21,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9351 states. [2025-03-16 19:32:21,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9351 to 9079. [2025-03-16 19:32:21,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9079 states, 9078 states have (on average 1.3961224939413968) internal successors, (12674), 9078 states have internal predecessors, (12674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:21,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9079 states to 9079 states and 12674 transitions. [2025-03-16 19:32:21,722 INFO L78 Accepts]: Start accepts. Automaton has 9079 states and 12674 transitions. Word has length 121 [2025-03-16 19:32:21,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:21,722 INFO L471 AbstractCegarLoop]: Abstraction has 9079 states and 12674 transitions. [2025-03-16 19:32:21,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:21,722 INFO L276 IsEmpty]: Start isEmpty. Operand 9079 states and 12674 transitions. [2025-03-16 19:32:21,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 19:32:21,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:21,724 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:21,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-16 19:32:21,724 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:21,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:21,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1314842859, now seen corresponding path program 1 times [2025-03-16 19:32:21,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:21,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733556934] [2025-03-16 19:32:21,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:21,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:21,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 19:32:21,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 19:32:21,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:21,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:21,794 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-16 19:32:21,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:21,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733556934] [2025-03-16 19:32:21,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733556934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:21,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:21,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:32:21,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352336503] [2025-03-16 19:32:21,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:21,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:32:21,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:21,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:32:21,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:32:21,797 INFO L87 Difference]: Start difference. First operand 9079 states and 12674 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:21,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:21,850 INFO L93 Difference]: Finished difference Result 17201 states and 23924 transitions. [2025-03-16 19:32:21,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:32:21,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2025-03-16 19:32:21,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:21,859 INFO L225 Difference]: With dead ends: 17201 [2025-03-16 19:32:21,859 INFO L226 Difference]: Without dead ends: 8199 [2025-03-16 19:32:21,865 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:32:21,866 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 51 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 309 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:32:21,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 309 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:32:21,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8199 states. [2025-03-16 19:32:21,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8199 to 7945. [2025-03-16 19:32:21,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7945 states, 7944 states have (on average 1.3733635448136958) internal successors, (10910), 7944 states have internal predecessors, (10910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:21,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7945 states to 7945 states and 10910 transitions. [2025-03-16 19:32:21,966 INFO L78 Accepts]: Start accepts. Automaton has 7945 states and 10910 transitions. Word has length 122 [2025-03-16 19:32:21,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:21,966 INFO L471 AbstractCegarLoop]: Abstraction has 7945 states and 10910 transitions. [2025-03-16 19:32:21,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:21,966 INFO L276 IsEmpty]: Start isEmpty. Operand 7945 states and 10910 transitions. [2025-03-16 19:32:21,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-16 19:32:21,968 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:21,968 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:21,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-16 19:32:21,968 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:21,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:21,969 INFO L85 PathProgramCache]: Analyzing trace with hash 869368102, now seen corresponding path program 1 times [2025-03-16 19:32:21,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:21,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716209148] [2025-03-16 19:32:21,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:21,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:21,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-16 19:32:21,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-16 19:32:21,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:21,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:22,045 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 19:32:22,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:22,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716209148] [2025-03-16 19:32:22,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716209148] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:22,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:22,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:32:22,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175168849] [2025-03-16 19:32:22,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:22,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:32:22,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:22,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:32:22,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:32:22,046 INFO L87 Difference]: Start difference. First operand 7945 states and 10910 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:22,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:22,084 INFO L93 Difference]: Finished difference Result 22757 states and 31056 transitions. [2025-03-16 19:32:22,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:32:22,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123 [2025-03-16 19:32:22,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:22,099 INFO L225 Difference]: With dead ends: 22757 [2025-03-16 19:32:22,099 INFO L226 Difference]: Without dead ends: 14889 [2025-03-16 19:32:22,107 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:32:22,109 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 44 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 310 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:32:22,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 310 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:32:22,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14889 states. [2025-03-16 19:32:22,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14889 to 13711. [2025-03-16 19:32:22,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13711 states, 13710 states have (on average 1.3527352297592998) internal successors, (18546), 13710 states have internal predecessors, (18546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:22,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13711 states to 13711 states and 18546 transitions. [2025-03-16 19:32:22,277 INFO L78 Accepts]: Start accepts. Automaton has 13711 states and 18546 transitions. Word has length 123 [2025-03-16 19:32:22,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:22,277 INFO L471 AbstractCegarLoop]: Abstraction has 13711 states and 18546 transitions. [2025-03-16 19:32:22,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:22,277 INFO L276 IsEmpty]: Start isEmpty. Operand 13711 states and 18546 transitions. [2025-03-16 19:32:22,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-16 19:32:22,279 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:22,279 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:22,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-16 19:32:22,279 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:22,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:22,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1171562743, now seen corresponding path program 1 times [2025-03-16 19:32:22,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:22,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670826268] [2025-03-16 19:32:22,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:22,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:22,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-16 19:32:22,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-16 19:32:22,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:22,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:22,574 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:32:22,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:22,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670826268] [2025-03-16 19:32:22,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670826268] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:32:22,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786377567] [2025-03-16 19:32:22,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:22,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:32:22,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:32:22,577 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:32:22,579 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:32:22,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-16 19:32:22,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-16 19:32:22,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:22,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:22,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-16 19:32:22,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:32:23,557 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:32:23,557 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:32:24,731 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:32:24,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786377567] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:32:24,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:32:24,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 30 [2025-03-16 19:32:24,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898856500] [2025-03-16 19:32:24,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:32:24,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-16 19:32:24,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:24,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-16 19:32:24,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=822, Unknown=0, NotChecked=0, Total=930 [2025-03-16 19:32:24,733 INFO L87 Difference]: Start difference. First operand 13711 states and 18546 transitions. Second operand has 31 states, 31 states have (on average 11.096774193548388) internal successors, (344), 30 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:34,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:34,653 INFO L93 Difference]: Finished difference Result 176421 states and 238881 transitions. [2025-03-16 19:32:34,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2025-03-16 19:32:34,654 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 11.096774193548388) internal successors, (344), 30 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2025-03-16 19:32:34,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:34,848 INFO L225 Difference]: With dead ends: 176421 [2025-03-16 19:32:34,848 INFO L226 Difference]: Without dead ends: 162787 [2025-03-16 19:32:34,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18568 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=6084, Invalid=45218, Unknown=0, NotChecked=0, Total=51302 [2025-03-16 19:32:34,893 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 3929 mSDsluCounter, 2911 mSDsCounter, 0 mSdLazyCounter, 3881 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3929 SdHoareTripleChecker+Valid, 3088 SdHoareTripleChecker+Invalid, 3970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 3881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:34,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3929 Valid, 3088 Invalid, 3970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 3881 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 19:32:34,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162787 states. [2025-03-16 19:32:35,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162787 to 82949. [2025-03-16 19:32:35,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82949 states, 82948 states have (on average 1.3382721705164682) internal successors, (111007), 82948 states have internal predecessors, (111007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:36,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82949 states to 82949 states and 111007 transitions. [2025-03-16 19:32:36,171 INFO L78 Accepts]: Start accepts. Automaton has 82949 states and 111007 transitions. Word has length 124 [2025-03-16 19:32:36,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:36,171 INFO L471 AbstractCegarLoop]: Abstraction has 82949 states and 111007 transitions. [2025-03-16 19:32:36,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 11.096774193548388) internal successors, (344), 30 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:36,172 INFO L276 IsEmpty]: Start isEmpty. Operand 82949 states and 111007 transitions. [2025-03-16 19:32:36,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-16 19:32:36,178 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:36,178 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:36,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 19:32:36,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:32:36,379 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:36,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:36,380 INFO L85 PathProgramCache]: Analyzing trace with hash 201770946, now seen corresponding path program 1 times [2025-03-16 19:32:36,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:36,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798135663] [2025-03-16 19:32:36,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:36,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:36,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-16 19:32:36,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-16 19:32:36,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:36,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:36,839 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:32:36,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:36,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798135663] [2025-03-16 19:32:36,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798135663] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:32:36,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460726478] [2025-03-16 19:32:36,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:36,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:32:36,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:32:36,841 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:32:36,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 19:32:36,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-16 19:32:36,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-16 19:32:36,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:36,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:36,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-16 19:32:36,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:32:39,066 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:32:39,066 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:32:42,041 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:32:42,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460726478] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:32:42,041 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:32:42,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 18] total 48 [2025-03-16 19:32:42,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326319806] [2025-03-16 19:32:42,041 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:32:42,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-16 19:32:42,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:42,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-16 19:32:42,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2106, Unknown=0, NotChecked=0, Total=2256 [2025-03-16 19:32:42,043 INFO L87 Difference]: Start difference. First operand 82949 states and 111007 transitions. Second operand has 48 states, 48 states have (on average 7.083333333333333) internal successors, (340), 48 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)