./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.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-var-start-time.3.2.ufo.UNBOUNDED.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 883ae562acbdc0ddaf57b9acda91c94407da87efc745325e9971c16b2e3730c3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:24:22,000 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:24:22,059 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:24:22,063 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:24:22,064 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:24:22,083 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:24:22,084 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:24:22,084 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:24:22,085 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:24:22,085 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:24:22,085 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:24:22,086 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:24:22,086 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:24:22,086 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:24:22,086 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:24:22,087 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:24:22,087 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:24:22,087 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:24:22,087 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:24:22,087 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:24:22,087 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:24:22,087 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:24:22,087 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:24:22,088 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:24:22,088 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:24:22,088 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:24:22,088 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:24:22,088 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:24:22,088 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:24:22,088 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:24:22,089 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:24:22,089 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:24:22,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:24:22,089 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:24:22,089 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:24:22,089 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:24:22,089 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:24:22,089 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:24:22,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:24:22,089 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:24:22,089 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:24:22,089 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:24:22,089 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:24:22,089 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 -> 883ae562acbdc0ddaf57b9acda91c94407da87efc745325e9971c16b2e3730c3 [2025-03-16 19:24:22,305 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:24:22,311 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:24:22,313 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:24:22,313 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:24:22,313 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:24:22,314 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-16 19:24:23,503 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2a68cdd6/43b013a8615d41dfbadc3081807a93e3/FLAG3f809e38d [2025-03-16 19:24:23,747 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:24:23,747 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-16 19:24:23,756 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2a68cdd6/43b013a8615d41dfbadc3081807a93e3/FLAG3f809e38d [2025-03-16 19:24:24,071 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2a68cdd6/43b013a8615d41dfbadc3081807a93e3 [2025-03-16 19:24:24,073 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:24:24,074 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:24:24,075 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:24:24,075 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:24:24,079 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:24:24,079 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:24:24" (1/1) ... [2025-03-16 19:24:24,080 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42e0a1a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:24:24, skipping insertion in model container [2025-03-16 19:24:24,080 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:24:24" (1/1) ... [2025-03-16 19:24:24,107 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:24:24,289 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[7165,7178] [2025-03-16 19:24:24,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:24:24,331 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:24:24,379 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[7165,7178] [2025-03-16 19:24:24,391 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:24:24,404 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:24:24,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:24:24 WrapperNode [2025-03-16 19:24:24,404 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:24:24,405 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:24:24,405 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:24:24,405 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:24:24,409 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:24:24" (1/1) ... [2025-03-16 19:24:24,416 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:24:24" (1/1) ... [2025-03-16 19:24:24,437 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 605 [2025-03-16 19:24:24,438 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:24:24,438 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:24:24,438 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:24:24,438 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:24:24,446 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:24:24" (1/1) ... [2025-03-16 19:24:24,447 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:24:24" (1/1) ... [2025-03-16 19:24:24,453 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:24:24" (1/1) ... [2025-03-16 19:24:24,467 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:24:24,467 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:24:24" (1/1) ... [2025-03-16 19:24:24,467 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:24:24" (1/1) ... [2025-03-16 19:24:24,473 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:24:24" (1/1) ... [2025-03-16 19:24:24,474 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:24:24" (1/1) ... [2025-03-16 19:24:24,475 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:24:24" (1/1) ... [2025-03-16 19:24:24,476 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:24:24" (1/1) ... [2025-03-16 19:24:24,478 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:24:24,479 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:24:24,479 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:24:24,479 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:24:24,480 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:24:24" (1/1) ... [2025-03-16 19:24:24,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:24:24,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:24:24,510 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:24:24,513 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:24:24,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:24:24,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:24:24,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:24:24,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:24:24,614 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:24:24,616 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:24:25,005 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L878: havoc main_~node3____CPAchecker_TMP_1~1#1; [2025-03-16 19:24:25,006 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L649: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-03-16 19:24:25,006 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L154: 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:24:25,006 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L535: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-16 19:24:25,006 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L453: havoc main_~node1____CPAchecker_TMP_0~1#1;havoc main_~node1__m1~3#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-03-16 19:24:25,006 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L306: havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1;havoc main_~node3__m3~1#1;havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-16 19:24:25,006 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L175: havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-16 19:24:25,006 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L621: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-16 19:24:25,006 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L922: havoc main_~node2____CPAchecker_TMP_1~1#1; [2025-03-16 19:24:25,006 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L330: havoc main_~node2__m2~2#1; [2025-03-16 19:24:25,006 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L348: havoc main_~node3__m3~2#1; [2025-03-16 19:24:25,006 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L563: havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-03-16 19:24:25,007 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L712: havoc main_~node1____CPAchecker_TMP_0~2#1; [2025-03-16 19:24:25,029 INFO L? ?]: Removed 78 outVars from TransFormulas that were not future-live. [2025-03-16 19:24:25,029 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:24:25,041 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:24:25,041 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:24:25,041 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:24:25 BoogieIcfgContainer [2025-03-16 19:24:25,042 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:24:25,043 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:24:25,043 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:24:25,047 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:24:25,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:24:24" (1/3) ... [2025-03-16 19:24:25,048 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@604af1f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:24:25, skipping insertion in model container [2025-03-16 19:24:25,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:24:24" (2/3) ... [2025-03-16 19:24:25,048 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@604af1f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:24:25, skipping insertion in model container [2025-03-16 19:24:25,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:24:25" (3/3) ... [2025-03-16 19:24:25,049 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-16 19:24:25,059 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:24:25,061 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c that has 1 procedures, 146 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-16 19:24:25,107 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:24:25,118 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;@20e98bbe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:24:25,119 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:24:25,123 INFO L276 IsEmpty]: Start isEmpty. Operand has 146 states, 144 states have (on average 1.7152777777777777) internal successors, (247), 145 states have internal predecessors, (247), 0 states have call successors, (0), 0 states 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:24:25,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-16 19:24:25,129 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:25,130 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:24:25,130 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:24:25,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:25,134 INFO L85 PathProgramCache]: Analyzing trace with hash -631998860, now seen corresponding path program 1 times [2025-03-16 19:24:25,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:25,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783070649] [2025-03-16 19:24:25,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:25,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:25,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-16 19:24:25,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-16 19:24:25,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:25,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:25,536 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:24:25,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:25,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783070649] [2025-03-16 19:24:25,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783070649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:25,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:25,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:24:25,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145152133] [2025-03-16 19:24:25,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:25,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:24:25,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:25,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:24:25,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:24:25,558 INFO L87 Difference]: Start difference. First operand has 146 states, 144 states have (on average 1.7152777777777777) internal successors, (247), 145 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states 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:24:25,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:25,717 INFO L93 Difference]: Finished difference Result 466 states and 754 transitions. [2025-03-16 19:24:25,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:24:25,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2025-03-16 19:24:25,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:25,731 INFO L225 Difference]: With dead ends: 466 [2025-03-16 19:24:25,731 INFO L226 Difference]: Without dead ends: 392 [2025-03-16 19:24:25,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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:24:25,739 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 824 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 1142 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:25,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [824 Valid, 1142 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:24:25,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-03-16 19:24:25,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 230. [2025-03-16 19:24:25,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 1.5109170305676856) internal successors, (346), 229 states have internal predecessors, (346), 0 states have call successors, (0), 0 states 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:24:25,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 346 transitions. [2025-03-16 19:24:25,776 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 346 transitions. Word has length 47 [2025-03-16 19:24:25,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:25,776 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 346 transitions. [2025-03-16 19:24:25,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states 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:24:25,777 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 346 transitions. [2025-03-16 19:24:25,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-16 19:24:25,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:25,778 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] [2025-03-16 19:24:25,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:24:25,778 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:24:25,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:25,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1554782978, now seen corresponding path program 1 times [2025-03-16 19:24:25,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:25,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972674264] [2025-03-16 19:24:25,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:25,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:25,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-16 19:24:25,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-16 19:24:25,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:25,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:25,884 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:24:25,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:25,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972674264] [2025-03-16 19:24:25,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972674264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:25,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:25,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:24:25,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257085334] [2025-03-16 19:24:25,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:25,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:24:25,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:25,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:24:25,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:24:25,886 INFO L87 Difference]: Start difference. First operand 230 states and 346 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states 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:24:25,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:25,927 INFO L93 Difference]: Finished difference Result 582 states and 894 transitions. [2025-03-16 19:24:25,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:24:25,927 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2025-03-16 19:24:25,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:25,930 INFO L225 Difference]: With dead ends: 582 [2025-03-16 19:24:25,930 INFO L226 Difference]: Without dead ends: 404 [2025-03-16 19:24:25,931 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:24:25,931 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 139 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:25,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 399 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:24:25,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2025-03-16 19:24:25,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 402. [2025-03-16 19:24:25,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 401 states have (on average 1.5012468827930174) internal successors, (602), 401 states have internal predecessors, (602), 0 states have call successors, (0), 0 states 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:24:25,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 602 transitions. [2025-03-16 19:24:25,947 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 602 transitions. Word has length 50 [2025-03-16 19:24:25,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:25,947 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 602 transitions. [2025-03-16 19:24:25,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states 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:24:25,948 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 602 transitions. [2025-03-16 19:24:25,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-16 19:24:25,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:25,949 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:24:25,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:24:25,949 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:24:25,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:25,949 INFO L85 PathProgramCache]: Analyzing trace with hash -361328035, now seen corresponding path program 1 times [2025-03-16 19:24:25,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:25,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685243269] [2025-03-16 19:24:25,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:25,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:25,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-16 19:24:25,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-16 19:24:25,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:25,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:26,068 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:24:26,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:26,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685243269] [2025-03-16 19:24:26,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685243269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:26,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:26,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:24:26,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115511579] [2025-03-16 19:24:26,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:26,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:24:26,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:26,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:24:26,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:24:26,069 INFO L87 Difference]: Start difference. First operand 402 states and 602 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states 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:24:26,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:26,099 INFO L93 Difference]: Finished difference Result 1012 states and 1535 transitions. [2025-03-16 19:24:26,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:24:26,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2025-03-16 19:24:26,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:26,102 INFO L225 Difference]: With dead ends: 1012 [2025-03-16 19:24:26,102 INFO L226 Difference]: Without dead ends: 704 [2025-03-16 19:24:26,105 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:24:26,106 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 143 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:26,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 391 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:24:26,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2025-03-16 19:24:26,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 702. [2025-03-16 19:24:26,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 701 states have (on average 1.4893009985734664) internal successors, (1044), 701 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states 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:24:26,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 1044 transitions. [2025-03-16 19:24:26,131 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 1044 transitions. Word has length 50 [2025-03-16 19:24:26,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:26,132 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 1044 transitions. [2025-03-16 19:24:26,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states 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:24:26,133 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 1044 transitions. [2025-03-16 19:24:26,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-16 19:24:26,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:26,136 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] [2025-03-16 19:24:26,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:24:26,136 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:24:26,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:26,136 INFO L85 PathProgramCache]: Analyzing trace with hash 874969438, now seen corresponding path program 1 times [2025-03-16 19:24:26,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:26,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033515440] [2025-03-16 19:24:26,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:26,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:26,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-16 19:24:26,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-16 19:24:26,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:26,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:26,208 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:24:26,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:26,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033515440] [2025-03-16 19:24:26,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033515440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:26,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:26,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:24:26,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113758332] [2025-03-16 19:24:26,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:26,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:24:26,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:26,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:24:26,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:24:26,210 INFO L87 Difference]: Start difference. First operand 702 states and 1044 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states 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:24:26,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:26,239 INFO L93 Difference]: Finished difference Result 1732 states and 2593 transitions. [2025-03-16 19:24:26,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:24:26,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2025-03-16 19:24:26,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:26,243 INFO L225 Difference]: With dead ends: 1732 [2025-03-16 19:24:26,244 INFO L226 Difference]: Without dead ends: 1208 [2025-03-16 19:24:26,244 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:24:26,245 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 130 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:26,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 409 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:24:26,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2025-03-16 19:24:26,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 1206. [2025-03-16 19:24:26,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1206 states, 1205 states have (on average 1.467219917012448) internal successors, (1768), 1205 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states 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:24:26,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1206 states to 1206 states and 1768 transitions. [2025-03-16 19:24:26,276 INFO L78 Accepts]: Start accepts. Automaton has 1206 states and 1768 transitions. Word has length 50 [2025-03-16 19:24:26,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:26,276 INFO L471 AbstractCegarLoop]: Abstraction has 1206 states and 1768 transitions. [2025-03-16 19:24:26,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states 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:24:26,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 1768 transitions. [2025-03-16 19:24:26,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-16 19:24:26,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:26,281 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] [2025-03-16 19:24:26,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:24:26,281 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:24:26,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:26,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1832442219, now seen corresponding path program 1 times [2025-03-16 19:24:26,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:26,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554222492] [2025-03-16 19:24:26,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:26,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:26,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-16 19:24:26,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-16 19:24:26,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:26,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:26,402 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:24:26,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:26,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554222492] [2025-03-16 19:24:26,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554222492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:26,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:26,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:24:26,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570633485] [2025-03-16 19:24:26,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:26,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:24:26,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:26,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:24:26,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:24:26,403 INFO L87 Difference]: Start difference. First operand 1206 states and 1768 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states 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:24:26,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:26,485 INFO L93 Difference]: Finished difference Result 2346 states and 3505 transitions. [2025-03-16 19:24:26,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:24:26,485 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2025-03-16 19:24:26,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:26,492 INFO L225 Difference]: With dead ends: 2346 [2025-03-16 19:24:26,492 INFO L226 Difference]: Without dead ends: 2000 [2025-03-16 19:24:26,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:24:26,495 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 567 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:26,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 879 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:24:26,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2000 states. [2025-03-16 19:24:26,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2000 to 1600. [2025-03-16 19:24:26,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1600 states, 1599 states have (on average 1.474671669793621) internal successors, (2358), 1599 states have internal predecessors, (2358), 0 states have call successors, (0), 0 states 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:24:26,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 2358 transitions. [2025-03-16 19:24:26,540 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 2358 transitions. Word has length 51 [2025-03-16 19:24:26,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:26,541 INFO L471 AbstractCegarLoop]: Abstraction has 1600 states and 2358 transitions. [2025-03-16 19:24:26,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states 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:24:26,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 2358 transitions. [2025-03-16 19:24:26,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-16 19:24:26,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:26,543 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] [2025-03-16 19:24:26,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:24:26,543 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:24:26,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:26,544 INFO L85 PathProgramCache]: Analyzing trace with hash 644152640, now seen corresponding path program 1 times [2025-03-16 19:24:26,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:26,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91623581] [2025-03-16 19:24:26,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:26,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:26,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-16 19:24:26,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-16 19:24:26,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:26,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:26,675 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:24:26,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:26,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91623581] [2025-03-16 19:24:26,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91623581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:26,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:26,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:24:26,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257450611] [2025-03-16 19:24:26,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:26,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:24:26,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:26,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:24:26,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:24:26,677 INFO L87 Difference]: Start difference. First operand 1600 states and 2358 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states 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:24:26,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:26,746 INFO L93 Difference]: Finished difference Result 2720 states and 4065 transitions. [2025-03-16 19:24:26,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:24:26,748 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2025-03-16 19:24:26,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:26,754 INFO L225 Difference]: With dead ends: 2720 [2025-03-16 19:24:26,755 INFO L226 Difference]: Without dead ends: 2374 [2025-03-16 19:24:26,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:24:26,757 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 563 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:26,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 880 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:24:26,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2374 states. [2025-03-16 19:24:26,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2374 to 1920. [2025-03-16 19:24:26,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1920 states, 1919 states have (on average 1.4804585721730068) internal successors, (2841), 1919 states have internal predecessors, (2841), 0 states have call successors, (0), 0 states 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:24:26,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1920 states to 1920 states and 2841 transitions. [2025-03-16 19:24:26,793 INFO L78 Accepts]: Start accepts. Automaton has 1920 states and 2841 transitions. Word has length 51 [2025-03-16 19:24:26,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:26,794 INFO L471 AbstractCegarLoop]: Abstraction has 1920 states and 2841 transitions. [2025-03-16 19:24:26,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states 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:24:26,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1920 states and 2841 transitions. [2025-03-16 19:24:26,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-16 19:24:26,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:26,795 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:24:26,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:24:26,795 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:24:26,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:26,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1746724005, now seen corresponding path program 1 times [2025-03-16 19:24:26,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:26,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030421615] [2025-03-16 19:24:26,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:26,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:26,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-16 19:24:26,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-16 19:24:26,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:26,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:26,898 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:24:26,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:26,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030421615] [2025-03-16 19:24:26,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030421615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:26,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:26,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:24:26,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71300297] [2025-03-16 19:24:26,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:26,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:24:26,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:26,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:24:26,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:24:26,900 INFO L87 Difference]: Start difference. First operand 1920 states and 2841 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:26,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:26,978 INFO L93 Difference]: Finished difference Result 3134 states and 4686 transitions. [2025-03-16 19:24:26,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:24:26,978 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2025-03-16 19:24:26,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:26,986 INFO L225 Difference]: With dead ends: 3134 [2025-03-16 19:24:26,986 INFO L226 Difference]: Without dead ends: 2788 [2025-03-16 19:24:26,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:24:26,989 INFO L435 NwaCegarLoop]: 381 mSDtfsCounter, 573 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:26,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 852 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:24:26,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2788 states. [2025-03-16 19:24:27,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2788 to 2215. [2025-03-16 19:24:27,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2215 states, 2214 states have (on average 1.485546522131888) internal successors, (3289), 2214 states have internal predecessors, (3289), 0 states have call successors, (0), 0 states 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:24:27,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2215 states to 2215 states and 3289 transitions. [2025-03-16 19:24:27,033 INFO L78 Accepts]: Start accepts. Automaton has 2215 states and 3289 transitions. Word has length 52 [2025-03-16 19:24:27,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:27,033 INFO L471 AbstractCegarLoop]: Abstraction has 2215 states and 3289 transitions. [2025-03-16 19:24:27,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:27,034 INFO L276 IsEmpty]: Start isEmpty. Operand 2215 states and 3289 transitions. [2025-03-16 19:24:27,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 19:24:27,037 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:27,037 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] [2025-03-16 19:24:27,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:24:27,037 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:24:27,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:27,039 INFO L85 PathProgramCache]: Analyzing trace with hash -829760095, now seen corresponding path program 1 times [2025-03-16 19:24:27,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:27,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270146391] [2025-03-16 19:24:27,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:27,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:27,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 19:24:27,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 19:24:27,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:27,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:27,142 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:24:27,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:27,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270146391] [2025-03-16 19:24:27,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270146391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:27,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:27,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:24:27,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994941112] [2025-03-16 19:24:27,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:27,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:24:27,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:27,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:24:27,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:24:27,144 INFO L87 Difference]: Start difference. First operand 2215 states and 3289 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states 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:24:27,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:27,308 INFO L93 Difference]: Finished difference Result 5259 states and 7812 transitions. [2025-03-16 19:24:27,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:24:27,308 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-03-16 19:24:27,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:27,317 INFO L225 Difference]: With dead ends: 5259 [2025-03-16 19:24:27,317 INFO L226 Difference]: Without dead ends: 3084 [2025-03-16 19:24:27,322 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:24:27,322 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 807 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:27,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 210 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:24:27,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3084 states. [2025-03-16 19:24:27,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3084 to 3066. [2025-03-16 19:24:27,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3066 states, 3065 states have (on average 1.4737357259380097) internal successors, (4517), 3065 states have internal predecessors, (4517), 0 states have call successors, (0), 0 states 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:24:27,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3066 states to 3066 states and 4517 transitions. [2025-03-16 19:24:27,379 INFO L78 Accepts]: Start accepts. Automaton has 3066 states and 4517 transitions. Word has length 55 [2025-03-16 19:24:27,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:27,380 INFO L471 AbstractCegarLoop]: Abstraction has 3066 states and 4517 transitions. [2025-03-16 19:24:27,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states 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:24:27,380 INFO L276 IsEmpty]: Start isEmpty. Operand 3066 states and 4517 transitions. [2025-03-16 19:24:27,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-16 19:24:27,384 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:27,384 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] [2025-03-16 19:24:27,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:24:27,385 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:24:27,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:27,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1851264548, now seen corresponding path program 1 times [2025-03-16 19:24:27,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:27,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516773492] [2025-03-16 19:24:27,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:27,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:27,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-16 19:24:27,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-16 19:24:27,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:27,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:27,459 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:24:27,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:27,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516773492] [2025-03-16 19:24:27,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516773492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:27,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:27,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:24:27,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152095188] [2025-03-16 19:24:27,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:27,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:24:27,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:27,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:24:27,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:24:27,460 INFO L87 Difference]: Start difference. First operand 3066 states and 4517 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states 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:24:27,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:27,633 INFO L93 Difference]: Finished difference Result 7165 states and 10535 transitions. [2025-03-16 19:24:27,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:24:27,633 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2025-03-16 19:24:27,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:27,643 INFO L225 Difference]: With dead ends: 7165 [2025-03-16 19:24:27,644 INFO L226 Difference]: Without dead ends: 4184 [2025-03-16 19:24:27,647 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:24:27,648 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 806 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:27,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 200 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:24:27,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4184 states. [2025-03-16 19:24:27,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4184 to 3066. [2025-03-16 19:24:27,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3066 states, 3065 states have (on average 1.4574225122349103) internal successors, (4467), 3065 states have internal predecessors, (4467), 0 states have call successors, (0), 0 states 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:24:27,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3066 states to 3066 states and 4467 transitions. [2025-03-16 19:24:27,731 INFO L78 Accepts]: Start accepts. Automaton has 3066 states and 4467 transitions. Word has length 56 [2025-03-16 19:24:27,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:27,731 INFO L471 AbstractCegarLoop]: Abstraction has 3066 states and 4467 transitions. [2025-03-16 19:24:27,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states 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:24:27,731 INFO L276 IsEmpty]: Start isEmpty. Operand 3066 states and 4467 transitions. [2025-03-16 19:24:27,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-16 19:24:27,733 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:27,733 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] [2025-03-16 19:24:27,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:24:27,733 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:24:27,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:27,734 INFO L85 PathProgramCache]: Analyzing trace with hash -40187168, now seen corresponding path program 1 times [2025-03-16 19:24:27,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:27,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294902260] [2025-03-16 19:24:27,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:27,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:27,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-16 19:24:27,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-16 19:24:27,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:27,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:27,811 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:24:27,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:27,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294902260] [2025-03-16 19:24:27,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294902260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:27,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:27,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:24:27,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523930711] [2025-03-16 19:24:27,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:27,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:24:27,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:27,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:24:27,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:24:27,812 INFO L87 Difference]: Start difference. First operand 3066 states and 4467 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states 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:24:27,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:27,965 INFO L93 Difference]: Finished difference Result 7235 states and 10536 transitions. [2025-03-16 19:24:27,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:24:27,965 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2025-03-16 19:24:27,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:27,976 INFO L225 Difference]: With dead ends: 7235 [2025-03-16 19:24:27,976 INFO L226 Difference]: Without dead ends: 4245 [2025-03-16 19:24:27,980 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:24:27,980 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 749 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:27,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [749 Valid, 212 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:24:27,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4245 states. [2025-03-16 19:24:28,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4245 to 4220. [2025-03-16 19:24:28,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4220 states, 4219 states have (on average 1.4418108556529983) internal successors, (6083), 4219 states have internal predecessors, (6083), 0 states have call successors, (0), 0 states 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:24:28,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4220 states to 4220 states and 6083 transitions. [2025-03-16 19:24:28,049 INFO L78 Accepts]: Start accepts. Automaton has 4220 states and 6083 transitions. Word has length 56 [2025-03-16 19:24:28,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:28,049 INFO L471 AbstractCegarLoop]: Abstraction has 4220 states and 6083 transitions. [2025-03-16 19:24:28,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states 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:24:28,049 INFO L276 IsEmpty]: Start isEmpty. Operand 4220 states and 6083 transitions. [2025-03-16 19:24:28,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-16 19:24:28,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:28,051 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:24:28,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:24:28,051 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:24:28,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:28,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1140660241, now seen corresponding path program 1 times [2025-03-16 19:24:28,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:28,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942988291] [2025-03-16 19:24:28,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:28,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:28,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-16 19:24:28,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-16 19:24:28,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:28,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:28,162 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:24:28,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:28,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942988291] [2025-03-16 19:24:28,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942988291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:28,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:28,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:24:28,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438812897] [2025-03-16 19:24:28,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:28,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:24:28,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:28,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:24:28,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:24:28,164 INFO L87 Difference]: Start difference. First operand 4220 states and 6083 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:28,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:28,410 INFO L93 Difference]: Finished difference Result 10021 states and 14368 transitions. [2025-03-16 19:24:28,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:24:28,410 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-03-16 19:24:28,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:28,434 INFO L225 Difference]: With dead ends: 10021 [2025-03-16 19:24:28,434 INFO L226 Difference]: Without dead ends: 8651 [2025-03-16 19:24:28,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:24:28,439 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 1342 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1342 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:28,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1342 Valid, 367 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:24:28,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8651 states. [2025-03-16 19:24:28,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8651 to 4232. [2025-03-16 19:24:28,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4232 states, 4231 states have (on average 1.4415031907350508) internal successors, (6099), 4231 states have internal predecessors, (6099), 0 states have call successors, (0), 0 states 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:24:28,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4232 states to 4232 states and 6099 transitions. [2025-03-16 19:24:28,532 INFO L78 Accepts]: Start accepts. Automaton has 4232 states and 6099 transitions. Word has length 57 [2025-03-16 19:24:28,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:28,532 INFO L471 AbstractCegarLoop]: Abstraction has 4232 states and 6099 transitions. [2025-03-16 19:24:28,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:28,532 INFO L276 IsEmpty]: Start isEmpty. Operand 4232 states and 6099 transitions. [2025-03-16 19:24:28,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-16 19:24:28,534 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:28,534 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:24:28,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:24:28,534 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:24:28,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:28,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1921000344, now seen corresponding path program 1 times [2025-03-16 19:24:28,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:28,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064415509] [2025-03-16 19:24:28,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:28,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:28,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-16 19:24:28,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-16 19:24:28,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:28,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:28,667 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:24:28,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:28,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064415509] [2025-03-16 19:24:28,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064415509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:28,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:28,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:24:28,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163838983] [2025-03-16 19:24:28,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:28,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:24:28,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:28,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:24:28,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:24:28,668 INFO L87 Difference]: Start difference. First operand 4232 states and 6099 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:28,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:28,911 INFO L93 Difference]: Finished difference Result 11028 states and 15786 transitions. [2025-03-16 19:24:28,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:24:28,911 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-03-16 19:24:28,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:28,925 INFO L225 Difference]: With dead ends: 11028 [2025-03-16 19:24:28,925 INFO L226 Difference]: Without dead ends: 8986 [2025-03-16 19:24:28,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:24:28,931 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 1180 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1180 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:28,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1180 Valid, 351 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:24:28,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8986 states. [2025-03-16 19:24:28,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8986 to 4310. [2025-03-16 19:24:29,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4310 states, 4309 states have (on average 1.4386168484567186) internal successors, (6199), 4309 states have internal predecessors, (6199), 0 states have call successors, (0), 0 states 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:24:29,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4310 states to 4310 states and 6199 transitions. [2025-03-16 19:24:29,011 INFO L78 Accepts]: Start accepts. Automaton has 4310 states and 6199 transitions. Word has length 58 [2025-03-16 19:24:29,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:29,011 INFO L471 AbstractCegarLoop]: Abstraction has 4310 states and 6199 transitions. [2025-03-16 19:24:29,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:29,012 INFO L276 IsEmpty]: Start isEmpty. Operand 4310 states and 6199 transitions. [2025-03-16 19:24:29,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-16 19:24:29,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:29,013 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:24:29,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:24:29,014 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:24:29,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:29,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1297391385, now seen corresponding path program 1 times [2025-03-16 19:24:29,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:29,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252059647] [2025-03-16 19:24:29,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:29,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:29,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-16 19:24:29,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-16 19:24:29,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:29,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:29,118 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:24:29,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:29,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252059647] [2025-03-16 19:24:29,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252059647] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:29,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:29,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:24:29,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316268363] [2025-03-16 19:24:29,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:29,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:24:29,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:29,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:24:29,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:24:29,119 INFO L87 Difference]: Start difference. First operand 4310 states and 6199 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:29,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:29,322 INFO L93 Difference]: Finished difference Result 9594 states and 13717 transitions. [2025-03-16 19:24:29,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:24:29,323 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-03-16 19:24:29,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:29,332 INFO L225 Difference]: With dead ends: 9594 [2025-03-16 19:24:29,332 INFO L226 Difference]: Without dead ends: 7380 [2025-03-16 19:24:29,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:24:29,335 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 999 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 999 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:29,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [999 Valid, 317 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:24:29,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7380 states. [2025-03-16 19:24:29,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7380 to 4330. [2025-03-16 19:24:29,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4330 states, 4329 states have (on average 1.4375144375144375) internal successors, (6223), 4329 states have internal predecessors, (6223), 0 states have call successors, (0), 0 states 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:24:29,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4330 states to 4330 states and 6223 transitions. [2025-03-16 19:24:29,391 INFO L78 Accepts]: Start accepts. Automaton has 4330 states and 6223 transitions. Word has length 58 [2025-03-16 19:24:29,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:29,392 INFO L471 AbstractCegarLoop]: Abstraction has 4330 states and 6223 transitions. [2025-03-16 19:24:29,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:29,392 INFO L276 IsEmpty]: Start isEmpty. Operand 4330 states and 6223 transitions. [2025-03-16 19:24:29,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-16 19:24:29,394 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:29,394 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:24:29,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:24:29,394 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:24:29,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:29,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1403329147, now seen corresponding path program 1 times [2025-03-16 19:24:29,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:29,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128547579] [2025-03-16 19:24:29,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:29,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:29,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-16 19:24:29,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-16 19:24:29,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:29,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:29,720 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:24:29,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:29,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128547579] [2025-03-16 19:24:29,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128547579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:29,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:29,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:24:29,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640566902] [2025-03-16 19:24:29,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:29,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:24:29,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:29,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:24:29,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:24:29,721 INFO L87 Difference]: Start difference. First operand 4330 states and 6223 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:30,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:30,193 INFO L93 Difference]: Finished difference Result 10210 states and 14723 transitions. [2025-03-16 19:24:30,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:24:30,194 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-03-16 19:24:30,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:30,202 INFO L225 Difference]: With dead ends: 10210 [2025-03-16 19:24:30,203 INFO L226 Difference]: Without dead ends: 6766 [2025-03-16 19:24:30,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:24:30,207 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 597 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:30,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 843 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:24:30,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6766 states. [2025-03-16 19:24:30,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6766 to 4248. [2025-03-16 19:24:30,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4248 states, 4247 states have (on average 1.4339533788556629) internal successors, (6090), 4247 states have internal predecessors, (6090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:30,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4248 states to 4248 states and 6090 transitions. [2025-03-16 19:24:30,268 INFO L78 Accepts]: Start accepts. Automaton has 4248 states and 6090 transitions. Word has length 60 [2025-03-16 19:24:30,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:30,268 INFO L471 AbstractCegarLoop]: Abstraction has 4248 states and 6090 transitions. [2025-03-16 19:24:30,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:30,269 INFO L276 IsEmpty]: Start isEmpty. Operand 4248 states and 6090 transitions. [2025-03-16 19:24:30,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-16 19:24:30,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:30,270 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:24:30,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:24:30,271 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:24:30,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:30,271 INFO L85 PathProgramCache]: Analyzing trace with hash -167031674, now seen corresponding path program 1 times [2025-03-16 19:24:30,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:30,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114507463] [2025-03-16 19:24:30,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:30,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:30,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-16 19:24:30,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-16 19:24:30,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:30,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:30,486 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:24:30,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:30,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114507463] [2025-03-16 19:24:30,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114507463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:30,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:30,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:24:30,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117353792] [2025-03-16 19:24:30,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:30,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:24:30,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:30,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:24:30,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:24:30,488 INFO L87 Difference]: Start difference. First operand 4248 states and 6090 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:30,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:30,960 INFO L93 Difference]: Finished difference Result 11358 states and 16359 transitions. [2025-03-16 19:24:30,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:24:30,960 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-03-16 19:24:30,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:30,975 INFO L225 Difference]: With dead ends: 11358 [2025-03-16 19:24:30,975 INFO L226 Difference]: Without dead ends: 7786 [2025-03-16 19:24:30,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2025-03-16 19:24:30,980 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 896 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 896 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:30,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [896 Valid, 686 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:24:30,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7786 states. [2025-03-16 19:24:31,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7786 to 4073. [2025-03-16 19:24:31,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4073 states, 4072 states have (on average 1.4302554027504912) internal successors, (5824), 4072 states have internal predecessors, (5824), 0 states have call successors, (0), 0 states 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:24:31,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4073 states to 4073 states and 5824 transitions. [2025-03-16 19:24:31,044 INFO L78 Accepts]: Start accepts. Automaton has 4073 states and 5824 transitions. Word has length 60 [2025-03-16 19:24:31,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:31,045 INFO L471 AbstractCegarLoop]: Abstraction has 4073 states and 5824 transitions. [2025-03-16 19:24:31,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:31,045 INFO L276 IsEmpty]: Start isEmpty. Operand 4073 states and 5824 transitions. [2025-03-16 19:24:31,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-16 19:24:31,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:31,046 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:24:31,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:24:31,046 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:24:31,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:31,047 INFO L85 PathProgramCache]: Analyzing trace with hash 309898951, now seen corresponding path program 1 times [2025-03-16 19:24:31,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:31,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91614575] [2025-03-16 19:24:31,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:31,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:31,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-16 19:24:31,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-16 19:24:31,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:31,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:31,289 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:24:31,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:31,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91614575] [2025-03-16 19:24:31,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91614575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:31,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:31,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:24:31,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737373300] [2025-03-16 19:24:31,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:31,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:24:31,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:31,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:24:31,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:24:31,291 INFO L87 Difference]: Start difference. First operand 4073 states and 5824 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:31,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:31,720 INFO L93 Difference]: Finished difference Result 10087 states and 14497 transitions. [2025-03-16 19:24:31,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:24:31,720 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-03-16 19:24:31,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:31,729 INFO L225 Difference]: With dead ends: 10087 [2025-03-16 19:24:31,729 INFO L226 Difference]: Without dead ends: 6573 [2025-03-16 19:24:31,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2025-03-16 19:24:31,734 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 785 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:31,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 683 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:24:31,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6573 states. [2025-03-16 19:24:31,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6573 to 4073. [2025-03-16 19:24:31,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4073 states, 4072 states have (on average 1.4287819253438114) internal successors, (5818), 4072 states have internal predecessors, (5818), 0 states have call successors, (0), 0 states 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:24:31,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4073 states to 4073 states and 5818 transitions. [2025-03-16 19:24:31,780 INFO L78 Accepts]: Start accepts. Automaton has 4073 states and 5818 transitions. Word has length 60 [2025-03-16 19:24:31,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:31,780 INFO L471 AbstractCegarLoop]: Abstraction has 4073 states and 5818 transitions. [2025-03-16 19:24:31,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:31,780 INFO L276 IsEmpty]: Start isEmpty. Operand 4073 states and 5818 transitions. [2025-03-16 19:24:31,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 19:24:31,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:31,782 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:24:31,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:24:31,782 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:24:31,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:31,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1525930859, now seen corresponding path program 1 times [2025-03-16 19:24:31,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:31,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469200139] [2025-03-16 19:24:31,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:31,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:31,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 19:24:31,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 19:24:31,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:31,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:31,819 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:24:31,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:31,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469200139] [2025-03-16 19:24:31,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469200139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:31,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:31,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:24:31,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688474837] [2025-03-16 19:24:31,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:31,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:24:31,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:31,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:24:31,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:24:31,821 INFO L87 Difference]: Start difference. First operand 4073 states and 5818 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 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:24:31,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:31,840 INFO L93 Difference]: Finished difference Result 6079 states and 8709 transitions. [2025-03-16 19:24:31,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:24:31,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 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:24:31,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:31,846 INFO L225 Difference]: With dead ends: 6079 [2025-03-16 19:24:31,846 INFO L226 Difference]: Without dead ends: 3966 [2025-03-16 19:24:31,848 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:24:31,848 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 132 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:31,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 476 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:24:31,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3966 states. [2025-03-16 19:24:31,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3966 to 3964. [2025-03-16 19:24:31,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3964 states, 3963 states have (on average 1.4130709058793842) internal successors, (5600), 3963 states have internal predecessors, (5600), 0 states have call successors, (0), 0 states 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:24:31,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3964 states to 3964 states and 5600 transitions. [2025-03-16 19:24:31,880 INFO L78 Accepts]: Start accepts. Automaton has 3964 states and 5600 transitions. Word has length 61 [2025-03-16 19:24:31,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:31,880 INFO L471 AbstractCegarLoop]: Abstraction has 3964 states and 5600 transitions. [2025-03-16 19:24:31,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 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:24:31,880 INFO L276 IsEmpty]: Start isEmpty. Operand 3964 states and 5600 transitions. [2025-03-16 19:24:31,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 19:24:31,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:31,882 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:24:31,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:24:31,882 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:24:31,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:31,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1205175797, now seen corresponding path program 1 times [2025-03-16 19:24:31,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:31,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573981948] [2025-03-16 19:24:31,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:31,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:31,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 19:24:31,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 19:24:31,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:31,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:31,938 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:24:31,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:31,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573981948] [2025-03-16 19:24:31,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573981948] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:31,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:31,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:24:31,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985129424] [2025-03-16 19:24:31,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:31,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:24:31,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:31,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:24:31,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:24:31,940 INFO L87 Difference]: Start difference. First operand 3964 states and 5600 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 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:24:31,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:31,960 INFO L93 Difference]: Finished difference Result 5466 states and 7721 transitions. [2025-03-16 19:24:31,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:24:31,961 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 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:24:31,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:31,969 INFO L225 Difference]: With dead ends: 5466 [2025-03-16 19:24:31,970 INFO L226 Difference]: Without dead ends: 3371 [2025-03-16 19:24:31,971 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:24:31,972 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 120 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:31,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 463 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:24:31,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3371 states. [2025-03-16 19:24:32,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3371 to 3369. [2025-03-16 19:24:32,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3369 states, 3368 states have (on average 1.3865795724465557) internal successors, (4670), 3368 states have internal predecessors, (4670), 0 states have call successors, (0), 0 states 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:24:32,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3369 states to 3369 states and 4670 transitions. [2025-03-16 19:24:32,015 INFO L78 Accepts]: Start accepts. Automaton has 3369 states and 4670 transitions. Word has length 61 [2025-03-16 19:24:32,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:32,015 INFO L471 AbstractCegarLoop]: Abstraction has 3369 states and 4670 transitions. [2025-03-16 19:24:32,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 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:24:32,015 INFO L276 IsEmpty]: Start isEmpty. Operand 3369 states and 4670 transitions. [2025-03-16 19:24:32,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 19:24:32,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:32,017 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:24:32,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:24:32,018 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:24:32,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:32,018 INFO L85 PathProgramCache]: Analyzing trace with hash 365343947, now seen corresponding path program 1 times [2025-03-16 19:24:32,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:32,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318670989] [2025-03-16 19:24:32,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:32,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:32,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 19:24:32,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 19:24:32,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:32,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:32,061 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:24:32,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:32,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318670989] [2025-03-16 19:24:32,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318670989] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:32,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:32,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:24:32,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49635850] [2025-03-16 19:24:32,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:32,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:24:32,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:32,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:24:32,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:24:32,064 INFO L87 Difference]: Start difference. First operand 3369 states and 4670 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 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:24:32,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:32,086 INFO L93 Difference]: Finished difference Result 4118 states and 5685 transitions. [2025-03-16 19:24:32,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:24:32,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 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:24:32,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:32,090 INFO L225 Difference]: With dead ends: 4118 [2025-03-16 19:24:32,090 INFO L226 Difference]: Without dead ends: 2781 [2025-03-16 19:24:32,092 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:24:32,092 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 150 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:32,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 480 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:24:32,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2781 states. [2025-03-16 19:24:32,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2781 to 2779. [2025-03-16 19:24:32,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2779 states, 2778 states have (on average 1.3538516918646508) internal successors, (3761), 2778 states have internal predecessors, (3761), 0 states have call successors, (0), 0 states 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:24:32,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2779 states to 2779 states and 3761 transitions. [2025-03-16 19:24:32,116 INFO L78 Accepts]: Start accepts. Automaton has 2779 states and 3761 transitions. Word has length 61 [2025-03-16 19:24:32,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:32,116 INFO L471 AbstractCegarLoop]: Abstraction has 2779 states and 3761 transitions. [2025-03-16 19:24:32,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 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:24:32,116 INFO L276 IsEmpty]: Start isEmpty. Operand 2779 states and 3761 transitions. [2025-03-16 19:24:32,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 19:24:32,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:32,118 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:24:32,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 19:24:32,118 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:24:32,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:32,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1226171064, now seen corresponding path program 1 times [2025-03-16 19:24:32,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:32,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164571622] [2025-03-16 19:24:32,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:32,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:32,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 19:24:32,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 19:24:32,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:32,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:32,150 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:24:32,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:32,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164571622] [2025-03-16 19:24:32,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164571622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:32,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:32,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:24:32,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4507810] [2025-03-16 19:24:32,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:32,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:24:32,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:32,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:24:32,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:24:32,151 INFO L87 Difference]: Start difference. First operand 2779 states and 3761 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:32,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:32,182 INFO L93 Difference]: Finished difference Result 5066 states and 6912 transitions. [2025-03-16 19:24:32,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:24:32,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-03-16 19:24:32,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:32,187 INFO L225 Difference]: With dead ends: 5066 [2025-03-16 19:24:32,187 INFO L226 Difference]: Without dead ends: 3662 [2025-03-16 19:24:32,189 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:24:32,189 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 158 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:32,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 313 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:24:32,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3662 states. [2025-03-16 19:24:32,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3662 to 2599. [2025-03-16 19:24:32,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2599 states, 2598 states have (on average 1.3545034642032332) internal successors, (3519), 2598 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states 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:24:32,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2599 states to 2599 states and 3519 transitions. [2025-03-16 19:24:32,214 INFO L78 Accepts]: Start accepts. Automaton has 2599 states and 3519 transitions. Word has length 62 [2025-03-16 19:24:32,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:32,214 INFO L471 AbstractCegarLoop]: Abstraction has 2599 states and 3519 transitions. [2025-03-16 19:24:32,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:32,214 INFO L276 IsEmpty]: Start isEmpty. Operand 2599 states and 3519 transitions. [2025-03-16 19:24:32,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 19:24:32,215 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:32,215 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:24:32,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 19:24:32,216 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:24:32,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:32,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1413683592, now seen corresponding path program 1 times [2025-03-16 19:24:32,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:32,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552958981] [2025-03-16 19:24:32,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:32,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:32,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 19:24:32,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 19:24:32,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:32,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:32,245 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:24:32,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:32,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552958981] [2025-03-16 19:24:32,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552958981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:32,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:32,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:24:32,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160024850] [2025-03-16 19:24:32,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:32,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:24:32,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:32,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:24:32,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:24:32,246 INFO L87 Difference]: Start difference. First operand 2599 states and 3519 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:32,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:32,276 INFO L93 Difference]: Finished difference Result 4746 states and 6475 transitions. [2025-03-16 19:24:32,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:24:32,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-03-16 19:24:32,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:32,281 INFO L225 Difference]: With dead ends: 4746 [2025-03-16 19:24:32,281 INFO L226 Difference]: Without dead ends: 3424 [2025-03-16 19:24:32,283 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:24:32,283 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 148 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:32,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 303 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:24:32,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3424 states. [2025-03-16 19:24:32,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3424 to 2429. [2025-03-16 19:24:32,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2429 states, 2428 states have (on average 1.3537891268533773) internal successors, (3287), 2428 states have internal predecessors, (3287), 0 states have call successors, (0), 0 states 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:24:32,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2429 states to 2429 states and 3287 transitions. [2025-03-16 19:24:32,320 INFO L78 Accepts]: Start accepts. Automaton has 2429 states and 3287 transitions. Word has length 62 [2025-03-16 19:24:32,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:32,321 INFO L471 AbstractCegarLoop]: Abstraction has 2429 states and 3287 transitions. [2025-03-16 19:24:32,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:32,321 INFO L276 IsEmpty]: Start isEmpty. Operand 2429 states and 3287 transitions. [2025-03-16 19:24:32,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 19:24:32,322 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:32,322 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:24:32,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 19:24:32,322 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:24:32,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:32,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1215233040, now seen corresponding path program 1 times [2025-03-16 19:24:32,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:32,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79180377] [2025-03-16 19:24:32,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:32,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:32,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 19:24:32,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 19:24:32,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:32,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:33,268 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:24:33,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:33,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79180377] [2025-03-16 19:24:33,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79180377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:33,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:33,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-03-16 19:24:33,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914619781] [2025-03-16 19:24:33,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:33,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-16 19:24:33,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:33,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-16 19:24:33,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2025-03-16 19:24:33,270 INFO L87 Difference]: Start difference. First operand 2429 states and 3287 transitions. Second operand has 23 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:35,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:35,041 INFO L93 Difference]: Finished difference Result 4889 states and 6674 transitions. [2025-03-16 19:24:35,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-16 19:24:35,041 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-03-16 19:24:35,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:35,049 INFO L225 Difference]: With dead ends: 4889 [2025-03-16 19:24:35,049 INFO L226 Difference]: Without dead ends: 4822 [2025-03-16 19:24:35,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=298, Invalid=1508, Unknown=0, NotChecked=0, Total=1806 [2025-03-16 19:24:35,052 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 1195 mSDsluCounter, 3373 mSDsCounter, 0 mSdLazyCounter, 2282 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1195 SdHoareTripleChecker+Valid, 3614 SdHoareTripleChecker+Invalid, 2283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:35,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1195 Valid, 3614 Invalid, 2283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2282 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 19:24:35,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4822 states. [2025-03-16 19:24:35,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4822 to 2441. [2025-03-16 19:24:35,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2441 states, 2440 states have (on average 1.3532786885245902) internal successors, (3302), 2440 states have internal predecessors, (3302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:35,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2441 states to 2441 states and 3302 transitions. [2025-03-16 19:24:35,080 INFO L78 Accepts]: Start accepts. Automaton has 2441 states and 3302 transitions. Word has length 62 [2025-03-16 19:24:35,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:35,080 INFO L471 AbstractCegarLoop]: Abstraction has 2441 states and 3302 transitions. [2025-03-16 19:24:35,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:35,080 INFO L276 IsEmpty]: Start isEmpty. Operand 2441 states and 3302 transitions. [2025-03-16 19:24:35,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 19:24:35,081 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:35,081 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:24:35,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 19:24:35,081 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:24:35,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:35,082 INFO L85 PathProgramCache]: Analyzing trace with hash 977776783, now seen corresponding path program 1 times [2025-03-16 19:24:35,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:35,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645900975] [2025-03-16 19:24:35,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:35,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:35,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 19:24:35,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 19:24:35,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:35,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:35,473 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:24:35,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:35,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645900975] [2025-03-16 19:24:35,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645900975] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:35,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:35,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 19:24:35,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431206192] [2025-03-16 19:24:35,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:35,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 19:24:35,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:35,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 19:24:35,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:24:35,475 INFO L87 Difference]: Start difference. First operand 2441 states and 3302 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:35,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:35,887 INFO L93 Difference]: Finished difference Result 3913 states and 5336 transitions. [2025-03-16 19:24:35,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:24:35,887 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-03-16 19:24:35,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:35,892 INFO L225 Difference]: With dead ends: 3913 [2025-03-16 19:24:35,892 INFO L226 Difference]: Without dead ends: 3561 [2025-03-16 19:24:35,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2025-03-16 19:24:35,893 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 1038 mSDsluCounter, 931 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 1104 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:35,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1038 Valid, 1104 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:24:35,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3561 states. [2025-03-16 19:24:35,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3561 to 2379. [2025-03-16 19:24:35,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2379 states, 2378 states have (on average 1.353658536585366) internal successors, (3219), 2378 states have internal predecessors, (3219), 0 states have call successors, (0), 0 states 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:24:35,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2379 states to 2379 states and 3219 transitions. [2025-03-16 19:24:35,916 INFO L78 Accepts]: Start accepts. Automaton has 2379 states and 3219 transitions. Word has length 62 [2025-03-16 19:24:35,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:35,916 INFO L471 AbstractCegarLoop]: Abstraction has 2379 states and 3219 transitions. [2025-03-16 19:24:35,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:35,916 INFO L276 IsEmpty]: Start isEmpty. Operand 2379 states and 3219 transitions. [2025-03-16 19:24:35,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-16 19:24:35,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:35,917 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:24:35,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 19:24:35,918 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:24:35,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:35,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1744721685, now seen corresponding path program 1 times [2025-03-16 19:24:35,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:35,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184314546] [2025-03-16 19:24:35,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:35,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:35,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-16 19:24:35,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-16 19:24:35,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:35,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:36,323 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:24:36,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:36,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184314546] [2025-03-16 19:24:36,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184314546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:36,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:36,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 19:24:36,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422289854] [2025-03-16 19:24:36,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:36,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 19:24:36,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:36,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 19:24:36,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:24:36,325 INFO L87 Difference]: Start difference. First operand 2379 states and 3219 transitions. Second operand has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 12 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:24:36,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:36,867 INFO L93 Difference]: Finished difference Result 4347 states and 5939 transitions. [2025-03-16 19:24:36,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 19:24:36,867 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 12 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:24:36,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:36,871 INFO L225 Difference]: With dead ends: 4347 [2025-03-16 19:24:36,871 INFO L226 Difference]: Without dead ends: 4006 [2025-03-16 19:24:36,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-03-16 19:24:36,873 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 1113 mSDsluCounter, 1168 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1113 SdHoareTripleChecker+Valid, 1364 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:36,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1113 Valid, 1364 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:24:36,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4006 states. [2025-03-16 19:24:36,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4006 to 2303. [2025-03-16 19:24:36,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2303 states, 2302 states have (on average 1.3540399652476107) internal successors, (3117), 2302 states have internal predecessors, (3117), 0 states have call successors, (0), 0 states 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:24:36,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2303 states to 2303 states and 3117 transitions. [2025-03-16 19:24:36,906 INFO L78 Accepts]: Start accepts. Automaton has 2303 states and 3117 transitions. Word has length 63 [2025-03-16 19:24:36,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:36,906 INFO L471 AbstractCegarLoop]: Abstraction has 2303 states and 3117 transitions. [2025-03-16 19:24:36,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 12 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:24:36,907 INFO L276 IsEmpty]: Start isEmpty. Operand 2303 states and 3117 transitions. [2025-03-16 19:24:36,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-16 19:24:36,908 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:36,909 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:24:36,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 19:24:36,909 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:24:36,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:36,910 INFO L85 PathProgramCache]: Analyzing trace with hash 63447206, now seen corresponding path program 1 times [2025-03-16 19:24:36,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:36,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919113414] [2025-03-16 19:24:36,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:36,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:36,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-16 19:24:36,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-16 19:24:36,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:36,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:36,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:24:36,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:36,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919113414] [2025-03-16 19:24:36,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919113414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:36,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:36,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:24:36,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216770116] [2025-03-16 19:24:36,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:36,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:24:36,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:36,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:24:36,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:24:36,986 INFO L87 Difference]: Start difference. First operand 2303 states and 3117 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 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:24:37,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:37,025 INFO L93 Difference]: Finished difference Result 2309 states and 3120 transitions. [2025-03-16 19:24:37,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:24:37,026 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 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:24:37,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:37,028 INFO L225 Difference]: With dead ends: 2309 [2025-03-16 19:24:37,028 INFO L226 Difference]: Without dead ends: 2102 [2025-03-16 19:24:37,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:24:37,028 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 702 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:37,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 463 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:24:37,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2102 states. [2025-03-16 19:24:37,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2102 to 2098. [2025-03-16 19:24:37,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2098 states, 2097 states have (on average 1.357653791130186) internal successors, (2847), 2097 states have internal predecessors, (2847), 0 states have call successors, (0), 0 states 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:24:37,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 2847 transitions. [2025-03-16 19:24:37,042 INFO L78 Accepts]: Start accepts. Automaton has 2098 states and 2847 transitions. Word has length 64 [2025-03-16 19:24:37,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:37,043 INFO L471 AbstractCegarLoop]: Abstraction has 2098 states and 2847 transitions. [2025-03-16 19:24:37,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 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:24:37,043 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 2847 transitions. [2025-03-16 19:24:37,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-16 19:24:37,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:37,044 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:24:37,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 19:24:37,044 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:24:37,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:37,045 INFO L85 PathProgramCache]: Analyzing trace with hash -413073252, now seen corresponding path program 1 times [2025-03-16 19:24:37,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:37,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167918340] [2025-03-16 19:24:37,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:37,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:37,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-16 19:24:37,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-16 19:24:37,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:37,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:37,097 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:24:37,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:37,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167918340] [2025-03-16 19:24:37,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167918340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:37,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:37,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:24:37,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720797535] [2025-03-16 19:24:37,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:37,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:24:37,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:37,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:24:37,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:24:37,099 INFO L87 Difference]: Start difference. First operand 2098 states and 2847 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 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:24:37,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:37,116 INFO L93 Difference]: Finished difference Result 5377 states and 7391 transitions. [2025-03-16 19:24:37,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:24:37,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 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:24:37,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:37,120 INFO L225 Difference]: With dead ends: 5377 [2025-03-16 19:24:37,120 INFO L226 Difference]: Without dead ends: 3660 [2025-03-16 19:24:37,121 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:24:37,122 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 104 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 394 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:24:37,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 394 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:24:37,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3660 states. [2025-03-16 19:24:37,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3660 to 3432. [2025-03-16 19:24:37,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3432 states, 3431 states have (on average 1.3643252696006996) internal successors, (4681), 3431 states have internal predecessors, (4681), 0 states have call successors, (0), 0 states 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:24:37,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3432 states to 3432 states and 4681 transitions. [2025-03-16 19:24:37,146 INFO L78 Accepts]: Start accepts. Automaton has 3432 states and 4681 transitions. Word has length 67 [2025-03-16 19:24:37,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:37,146 INFO L471 AbstractCegarLoop]: Abstraction has 3432 states and 4681 transitions. [2025-03-16 19:24:37,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 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:24:37,147 INFO L276 IsEmpty]: Start isEmpty. Operand 3432 states and 4681 transitions. [2025-03-16 19:24:37,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-16 19:24:37,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:37,148 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:24:37,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-16 19:24:37,149 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:24:37,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:37,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1265348791, now seen corresponding path program 1 times [2025-03-16 19:24:37,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:37,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365310156] [2025-03-16 19:24:37,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:37,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:37,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 19:24:37,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 19:24:37,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:37,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:37,208 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:24:37,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:37,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365310156] [2025-03-16 19:24:37,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365310156] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:37,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:37,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:24:37,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820407984] [2025-03-16 19:24:37,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:37,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:24:37,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:37,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:24:37,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:24:37,209 INFO L87 Difference]: Start difference. First operand 3432 states and 4681 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 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:24:37,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:37,232 INFO L93 Difference]: Finished difference Result 9224 states and 12655 transitions. [2025-03-16 19:24:37,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:24:37,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 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:24:37,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:37,238 INFO L225 Difference]: With dead ends: 9224 [2025-03-16 19:24:37,238 INFO L226 Difference]: Without dead ends: 6173 [2025-03-16 19:24:37,241 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:24:37,241 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 92 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 386 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:24:37,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 386 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:24:37,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6173 states. [2025-03-16 19:24:37,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6173 to 5719. [2025-03-16 19:24:37,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5719 states, 5718 states have (on average 1.362889122070654) internal successors, (7793), 5718 states have internal predecessors, (7793), 0 states have call successors, (0), 0 states 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:24:37,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5719 states to 5719 states and 7793 transitions. [2025-03-16 19:24:37,315 INFO L78 Accepts]: Start accepts. Automaton has 5719 states and 7793 transitions. Word has length 68 [2025-03-16 19:24:37,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:37,315 INFO L471 AbstractCegarLoop]: Abstraction has 5719 states and 7793 transitions. [2025-03-16 19:24:37,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 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:24:37,315 INFO L276 IsEmpty]: Start isEmpty. Operand 5719 states and 7793 transitions. [2025-03-16 19:24:37,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 19:24:37,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:37,317 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:24:37,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-16 19:24:37,317 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:24:37,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:37,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1204186252, now seen corresponding path program 1 times [2025-03-16 19:24:37,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:37,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392974348] [2025-03-16 19:24:37,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:37,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:37,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 19:24:37,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 19:24:37,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:37,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:37,497 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:24:37,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:37,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392974348] [2025-03-16 19:24:37,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392974348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:37,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:37,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:24:37,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114576067] [2025-03-16 19:24:37,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:37,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:24:37,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:37,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:24:37,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:24:37,499 INFO L87 Difference]: Start difference. First operand 5719 states and 7793 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 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:24:37,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:37,532 INFO L93 Difference]: Finished difference Result 6213 states and 8450 transitions. [2025-03-16 19:24:37,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:24:37,533 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 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:24:37,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:37,539 INFO L225 Difference]: With dead ends: 6213 [2025-03-16 19:24:37,540 INFO L226 Difference]: Without dead ends: 6211 [2025-03-16 19:24:37,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:24:37,541 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 0 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:37,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 915 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:24:37,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6211 states. [2025-03-16 19:24:37,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6211 to 6211. [2025-03-16 19:24:37,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6211 states, 6210 states have (on average 1.3341384863123993) internal successors, (8285), 6210 states have internal predecessors, (8285), 0 states have call successors, (0), 0 states 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:24:37,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6211 states to 6211 states and 8285 transitions. [2025-03-16 19:24:37,605 INFO L78 Accepts]: Start accepts. Automaton has 6211 states and 8285 transitions. Word has length 71 [2025-03-16 19:24:37,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:37,605 INFO L471 AbstractCegarLoop]: Abstraction has 6211 states and 8285 transitions. [2025-03-16 19:24:37,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 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:24:37,605 INFO L276 IsEmpty]: Start isEmpty. Operand 6211 states and 8285 transitions. [2025-03-16 19:24:37,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-16 19:24:37,607 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:37,607 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:24:37,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-16 19:24:37,607 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:24:37,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:37,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1472728137, now seen corresponding path program 1 times [2025-03-16 19:24:37,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:37,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167631705] [2025-03-16 19:24:37,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:37,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:37,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-16 19:24:37,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-16 19:24:37,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:37,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:37,655 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:24:37,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:37,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167631705] [2025-03-16 19:24:37,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167631705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:37,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:37,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:24:37,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840824730] [2025-03-16 19:24:37,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:37,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:24:37,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:37,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:24:37,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:24:37,657 INFO L87 Difference]: Start difference. First operand 6211 states and 8285 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:37,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:37,706 INFO L93 Difference]: Finished difference Result 16457 states and 21908 transitions. [2025-03-16 19:24:37,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:24:37,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-03-16 19:24:37,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:37,724 INFO L225 Difference]: With dead ends: 16457 [2025-03-16 19:24:37,724 INFO L226 Difference]: Without dead ends: 10565 [2025-03-16 19:24:37,732 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:24:37,734 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 114 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:37,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 306 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:24:37,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10565 states. [2025-03-16 19:24:37,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10565 to 10399. [2025-03-16 19:24:37,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10399 states, 10398 states have (on average 1.297364877861127) internal successors, (13490), 10398 states have internal predecessors, (13490), 0 states have call successors, (0), 0 states 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:24:37,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10399 states to 10399 states and 13490 transitions. [2025-03-16 19:24:37,855 INFO L78 Accepts]: Start accepts. Automaton has 10399 states and 13490 transitions. Word has length 72 [2025-03-16 19:24:37,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:37,855 INFO L471 AbstractCegarLoop]: Abstraction has 10399 states and 13490 transitions. [2025-03-16 19:24:37,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:37,855 INFO L276 IsEmpty]: Start isEmpty. Operand 10399 states and 13490 transitions. [2025-03-16 19:24:37,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-16 19:24:37,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:37,857 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:24:37,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-16 19:24:37,857 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:24:37,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:37,857 INFO L85 PathProgramCache]: Analyzing trace with hash 464891309, now seen corresponding path program 1 times [2025-03-16 19:24:37,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:37,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893890379] [2025-03-16 19:24:37,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:37,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:37,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 19:24:37,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 19:24:37,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:37,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:37,912 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:24:37,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:37,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893890379] [2025-03-16 19:24:37,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893890379] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:37,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:37,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:24:37,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664586065] [2025-03-16 19:24:37,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:37,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:24:37,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:37,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:24:37,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:24:37,914 INFO L87 Difference]: Start difference. First operand 10399 states and 13490 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 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:24:37,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:37,964 INFO L93 Difference]: Finished difference Result 26475 states and 34312 transitions. [2025-03-16 19:24:37,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:24:37,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 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:24:37,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:37,982 INFO L225 Difference]: With dead ends: 26475 [2025-03-16 19:24:37,982 INFO L226 Difference]: Without dead ends: 16384 [2025-03-16 19:24:37,992 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:24:37,992 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 96 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 381 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:24:37,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 381 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:24:38,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16384 states. [2025-03-16 19:24:38,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16384 to 14798. [2025-03-16 19:24:38,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14798 states, 14797 states have (on average 1.2850577819828344) internal successors, (19015), 14797 states have internal predecessors, (19015), 0 states have call successors, (0), 0 states 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:24:38,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14798 states to 14798 states and 19015 transitions. [2025-03-16 19:24:38,172 INFO L78 Accepts]: Start accepts. Automaton has 14798 states and 19015 transitions. Word has length 73 [2025-03-16 19:24:38,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:38,172 INFO L471 AbstractCegarLoop]: Abstraction has 14798 states and 19015 transitions. [2025-03-16 19:24:38,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 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:24:38,173 INFO L276 IsEmpty]: Start isEmpty. Operand 14798 states and 19015 transitions. [2025-03-16 19:24:38,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 19:24:38,176 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:38,176 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:24:38,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-16 19:24:38,176 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:24:38,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:38,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1637039022, now seen corresponding path program 1 times [2025-03-16 19:24:38,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:38,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392561757] [2025-03-16 19:24:38,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:38,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:38,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 19:24:38,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 19:24:38,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:38,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:38,332 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:24:38,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:38,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392561757] [2025-03-16 19:24:38,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392561757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:38,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:38,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:24:38,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461992102] [2025-03-16 19:24:38,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:38,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:24:38,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:38,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:24:38,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:24:38,334 INFO L87 Difference]: Start difference. First operand 14798 states and 19015 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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:24:38,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:38,748 INFO L93 Difference]: Finished difference Result 34616 states and 44337 transitions. [2025-03-16 19:24:38,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 19:24:38,748 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2025-03-16 19:24:38,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:38,778 INFO L225 Difference]: With dead ends: 34616 [2025-03-16 19:24:38,778 INFO L226 Difference]: Without dead ends: 27050 [2025-03-16 19:24:38,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2025-03-16 19:24:38,790 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 518 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:38,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 669 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:24:38,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27050 states. [2025-03-16 19:24:39,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27050 to 23460. [2025-03-16 19:24:39,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23460 states, 23459 states have (on average 1.2855620444179205) internal successors, (30158), 23459 states have internal predecessors, (30158), 0 states have call successors, (0), 0 states 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:24:39,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23460 states to 23460 states and 30158 transitions. [2025-03-16 19:24:39,060 INFO L78 Accepts]: Start accepts. Automaton has 23460 states and 30158 transitions. Word has length 91 [2025-03-16 19:24:39,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:39,060 INFO L471 AbstractCegarLoop]: Abstraction has 23460 states and 30158 transitions. [2025-03-16 19:24:39,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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:24:39,060 INFO L276 IsEmpty]: Start isEmpty. Operand 23460 states and 30158 transitions. [2025-03-16 19:24:39,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 19:24:39,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:39,064 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:24:39,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-16 19:24:39,064 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:24:39,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:39,064 INFO L85 PathProgramCache]: Analyzing trace with hash 606569554, now seen corresponding path program 1 times [2025-03-16 19:24:39,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:39,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353167490] [2025-03-16 19:24:39,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:39,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:39,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 19:24:39,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 19:24:39,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:39,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:39,289 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:24:39,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:39,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353167490] [2025-03-16 19:24:39,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353167490] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:24:39,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650466537] [2025-03-16 19:24:39,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:39,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:24:39,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:24:39,291 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:24:39,293 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:24:39,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 19:24:39,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 19:24:39,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:39,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:39,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-16 19:24:39,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:24:40,366 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:24:40,367 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:24:41,241 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:24:41,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650466537] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:24:41,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:24:41,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 13] total 29 [2025-03-16 19:24:41,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013999824] [2025-03-16 19:24:41,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:24:41,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-16 19:24:41,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:41,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-16 19:24:41,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=753, Unknown=0, NotChecked=0, Total=870 [2025-03-16 19:24:41,244 INFO L87 Difference]: Start difference. First operand 23460 states and 30158 transitions. Second operand has 30 states, 30 states have (on average 7.866666666666666) internal successors, (236), 29 states have internal predecessors, (236), 0 states have call successors, (0), 0 states 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:24:48,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:48,592 INFO L93 Difference]: Finished difference Result 130833 states and 166197 transitions. [2025-03-16 19:24:48,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2025-03-16 19:24:48,593 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 7.866666666666666) internal successors, (236), 29 states have internal predecessors, (236), 0 states have call successors, (0), 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 91 [2025-03-16 19:24:48,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:48,730 INFO L225 Difference]: With dead ends: 130833 [2025-03-16 19:24:48,731 INFO L226 Difference]: Without dead ends: 119455 [2025-03-16 19:24:48,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12331 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=5663, Invalid=26557, Unknown=0, NotChecked=0, Total=32220 [2025-03-16 19:24:48,754 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 5680 mSDsluCounter, 4485 mSDsCounter, 0 mSdLazyCounter, 4584 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5680 SdHoareTripleChecker+Valid, 4786 SdHoareTripleChecker+Invalid, 4698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 4584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:48,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5680 Valid, 4786 Invalid, 4698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 4584 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-16 19:24:48,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119455 states. [2025-03-16 19:24:49,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119455 to 45411. [2025-03-16 19:24:49,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45411 states, 45410 states have (on average 1.2856859722528078) internal successors, (58383), 45410 states have internal predecessors, (58383), 0 states have call successors, (0), 0 states 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:24:49,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45411 states to 45411 states and 58383 transitions. [2025-03-16 19:24:49,507 INFO L78 Accepts]: Start accepts. Automaton has 45411 states and 58383 transitions. Word has length 91 [2025-03-16 19:24:49,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:49,507 INFO L471 AbstractCegarLoop]: Abstraction has 45411 states and 58383 transitions. [2025-03-16 19:24:49,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 7.866666666666666) internal successors, (236), 29 states have internal predecessors, (236), 0 states have call successors, (0), 0 states 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:24:49,508 INFO L276 IsEmpty]: Start isEmpty. Operand 45411 states and 58383 transitions. [2025-03-16 19:24:49,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-16 19:24:49,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:49,513 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:24:49,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 19:24:49,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-03-16 19:24:49,714 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:24:49,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:49,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1364583622, now seen corresponding path program 1 times [2025-03-16 19:24:49,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:49,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611415485] [2025-03-16 19:24:49,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:49,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:49,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-16 19:24:49,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-16 19:24:49,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:49,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:49,854 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:24:49,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:49,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611415485] [2025-03-16 19:24:49,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611415485] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:24:49,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001146097] [2025-03-16 19:24:49,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:49,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:24:49,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:24:49,859 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:24:49,861 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:24:49,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-16 19:24:49,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-16 19:24:49,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:49,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:49,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-16 19:24:49,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:24:50,369 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:24:50,370 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:24:50,761 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:24:50,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001146097] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:24:50,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:24:50,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10, 9] total 18 [2025-03-16 19:24:50,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915348317] [2025-03-16 19:24:50,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:24:50,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-16 19:24:50,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:50,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-16 19:24:50,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:24:50,762 INFO L87 Difference]: Start difference. First operand 45411 states and 58383 transitions. Second operand has 18 states, 18 states have (on average 12.11111111111111) internal successors, (218), 18 states have internal predecessors, (218), 0 states have call successors, (0), 0 states 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:24:52,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:52,677 INFO L93 Difference]: Finished difference Result 268951 states and 342622 transitions. [2025-03-16 19:24:52,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-16 19:24:52,678 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 12.11111111111111) internal successors, (218), 18 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-03-16 19:24:52,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:52,924 INFO L225 Difference]: With dead ends: 268951 [2025-03-16 19:24:52,924 INFO L226 Difference]: Without dead ends: 223920 [2025-03-16 19:24:52,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 170 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1182 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=823, Invalid=2483, Unknown=0, NotChecked=0, Total=3306 [2025-03-16 19:24:52,972 INFO L435 NwaCegarLoop]: 791 mSDtfsCounter, 2872 mSDsluCounter, 4225 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2872 SdHoareTripleChecker+Valid, 5016 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:52,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2872 Valid, 5016 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 19:24:53,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223920 states. [2025-03-16 19:24:54,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223920 to 164181. [2025-03-16 19:24:55,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164181 states, 164180 states have (on average 1.2701851626263856) internal successors, (208539), 164180 states have internal predecessors, (208539), 0 states have call successors, (0), 0 states 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:24:55,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164181 states to 164181 states and 208539 transitions. [2025-03-16 19:24:55,248 INFO L78 Accepts]: Start accepts. Automaton has 164181 states and 208539 transitions. Word has length 92 [2025-03-16 19:24:55,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:55,248 INFO L471 AbstractCegarLoop]: Abstraction has 164181 states and 208539 transitions. [2025-03-16 19:24:55,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 12.11111111111111) internal successors, (218), 18 states have internal predecessors, (218), 0 states have call successors, (0), 0 states 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:24:55,248 INFO L276 IsEmpty]: Start isEmpty. Operand 164181 states and 208539 transitions. [2025-03-16 19:24:55,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-16 19:24:55,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:55,256 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:24:55,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 19:24:55,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-03-16 19:24:55,457 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:24:55,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:55,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1049354703, now seen corresponding path program 1 times [2025-03-16 19:24:55,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:55,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414556770] [2025-03-16 19:24:55,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:55,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:55,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-16 19:24:55,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-16 19:24:55,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:55,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:55,494 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 19:24:55,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:55,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414556770] [2025-03-16 19:24:55,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414556770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:24:55,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:24:55,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:24:55,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911190007] [2025-03-16 19:24:55,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:24:55,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:24:55,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:55,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:24:55,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:24:55,496 INFO L87 Difference]: Start difference. First operand 164181 states and 208539 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:56,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:56,844 INFO L93 Difference]: Finished difference Result 304521 states and 387304 transitions. [2025-03-16 19:24:56,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:24:56,845 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-16 19:24:56,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:57,022 INFO L225 Difference]: With dead ends: 304521 [2025-03-16 19:24:57,022 INFO L226 Difference]: Without dead ends: 140720 [2025-03-16 19:24:57,075 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:24:57,076 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 138 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:57,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 169 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:24:57,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140720 states. [2025-03-16 19:24:58,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140720 to 140720. [2025-03-16 19:24:58,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140720 states, 140719 states have (on average 1.2552533772980194) internal successors, (176638), 140719 states have internal predecessors, (176638), 0 states have call successors, (0), 0 states 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:24:58,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140720 states to 140720 states and 176638 transitions. [2025-03-16 19:24:58,852 INFO L78 Accepts]: Start accepts. Automaton has 140720 states and 176638 transitions. Word has length 98 [2025-03-16 19:24:58,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:24:58,852 INFO L471 AbstractCegarLoop]: Abstraction has 140720 states and 176638 transitions. [2025-03-16 19:24:58,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:24:58,852 INFO L276 IsEmpty]: Start isEmpty. Operand 140720 states and 176638 transitions. [2025-03-16 19:24:58,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 19:24:58,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:24:58,857 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:24:58,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-16 19:24:58,858 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:24:58,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:24:58,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1896965360, now seen corresponding path program 1 times [2025-03-16 19:24:58,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:24:58,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744987272] [2025-03-16 19:24:58,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:58,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:24:58,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 19:24:58,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 19:24:58,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:58,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:58,909 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:24:58,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:24:58,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744987272] [2025-03-16 19:24:58,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744987272] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:24:58,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707072265] [2025-03-16 19:24:58,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:24:58,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:24:58,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:24:58,911 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:24:58,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 19:24:58,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 19:24:59,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 19:24:59,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:24:59,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:24:59,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 19:24:59,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:24:59,230 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:24:59,230 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:24:59,335 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:24:59,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707072265] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:24:59,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:24:59,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2025-03-16 19:24:59,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91831577] [2025-03-16 19:24:59,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:24:59,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 19:24:59,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:24:59,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 19:24:59,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-03-16 19:24:59,337 INFO L87 Difference]: Start difference. First operand 140720 states and 176638 transitions. Second operand has 14 states, 14 states have (on average 18.714285714285715) internal successors, (262), 14 states have internal predecessors, (262), 0 states have call successors, (0), 0 states 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:25:00,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:25:00,131 INFO L93 Difference]: Finished difference Result 253275 states and 318156 transitions. [2025-03-16 19:25:00,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:25:00,132 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 18.714285714285715) internal successors, (262), 14 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-03-16 19:25:00,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:25:00,269 INFO L225 Difference]: With dead ends: 253275 [2025-03-16 19:25:00,269 INFO L226 Difference]: Without dead ends: 112902 [2025-03-16 19:25:00,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2025-03-16 19:25:00,314 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 1499 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1499 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:25:00,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1499 Valid, 755 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:25:00,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112902 states. [2025-03-16 19:25:01,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112902 to 110058. [2025-03-16 19:25:01,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110058 states, 110057 states have (on average 1.2305441725651254) internal successors, (135430), 110057 states have internal predecessors, (135430), 0 states have call successors, (0), 0 states 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:25:01,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110058 states to 110058 states and 135430 transitions. [2025-03-16 19:25:01,812 INFO L78 Accepts]: Start accepts. Automaton has 110058 states and 135430 transitions. Word has length 99 [2025-03-16 19:25:01,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:25:01,813 INFO L471 AbstractCegarLoop]: Abstraction has 110058 states and 135430 transitions. [2025-03-16 19:25:01,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 18.714285714285715) internal successors, (262), 14 states have internal predecessors, (262), 0 states have call successors, (0), 0 states 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:25:01,813 INFO L276 IsEmpty]: Start isEmpty. Operand 110058 states and 135430 transitions. [2025-03-16 19:25:01,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-16 19:25:01,819 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:25:01,819 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:25:01,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 19:25:02,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:25:02,020 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:25:02,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:25:02,021 INFO L85 PathProgramCache]: Analyzing trace with hash 577849924, now seen corresponding path program 1 times [2025-03-16 19:25:02,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:25:02,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083796260] [2025-03-16 19:25:02,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:02,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:25:02,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-16 19:25:02,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-16 19:25:02,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:02,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:02,078 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:02,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:25:02,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083796260] [2025-03-16 19:25:02,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083796260] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:25:02,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584483987] [2025-03-16 19:25:02,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:02,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:25:02,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:25:02,081 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:25:02,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 19:25:02,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-16 19:25:02,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-16 19:25:02,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:02,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:02,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 19:25:02,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:25:02,423 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:02,424 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:25:02,544 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:02,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584483987] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:25:02,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:25:02,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2025-03-16 19:25:02,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942140897] [2025-03-16 19:25:02,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:25:02,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 19:25:02,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:25:02,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 19:25:02,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-03-16 19:25:02,547 INFO L87 Difference]: Start difference. First operand 110058 states and 135430 transitions. Second operand has 14 states, 14 states have (on average 20.285714285714285) internal successors, (284), 14 states have internal predecessors, (284), 0 states have call successors, (0), 0 states 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:25:03,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:25:03,399 INFO L93 Difference]: Finished difference Result 238649 states and 292672 transitions. [2025-03-16 19:25:03,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:25:03,399 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 20.285714285714285) internal successors, (284), 14 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2025-03-16 19:25:03,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:25:03,535 INFO L225 Difference]: With dead ends: 238649 [2025-03-16 19:25:03,535 INFO L226 Difference]: Without dead ends: 128960 [2025-03-16 19:25:03,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 199 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2025-03-16 19:25:03,582 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 1355 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1355 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:25:03,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1355 Valid, 637 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:25:03,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128960 states. [2025-03-16 19:25:04,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128960 to 114942. [2025-03-16 19:25:04,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114942 states, 114941 states have (on average 1.2235668734394167) internal successors, (140638), 114941 states have internal predecessors, (140638), 0 states have call successors, (0), 0 states 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:25:05,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114942 states to 114942 states and 140638 transitions. [2025-03-16 19:25:05,024 INFO L78 Accepts]: Start accepts. Automaton has 114942 states and 140638 transitions. Word has length 103 [2025-03-16 19:25:05,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:25:05,024 INFO L471 AbstractCegarLoop]: Abstraction has 114942 states and 140638 transitions. [2025-03-16 19:25:05,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 20.285714285714285) internal successors, (284), 14 states have internal predecessors, (284), 0 states have call successors, (0), 0 states 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:25:05,025 INFO L276 IsEmpty]: Start isEmpty. Operand 114942 states and 140638 transitions. [2025-03-16 19:25:05,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-16 19:25:05,033 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:25:05,033 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:25:05,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-16 19:25:05,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:25:05,234 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:25:05,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:25:05,235 INFO L85 PathProgramCache]: Analyzing trace with hash 565343953, now seen corresponding path program 1 times [2025-03-16 19:25:05,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:25:05,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705388635] [2025-03-16 19:25:05,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:05,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:25:05,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-16 19:25:05,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-16 19:25:05,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:05,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:05,307 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:05,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:25:05,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705388635] [2025-03-16 19:25:05,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705388635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:25:05,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:25:05,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:25:05,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892632882] [2025-03-16 19:25:05,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:25:05,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:25:05,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:25:05,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:25:05,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:25:05,309 INFO L87 Difference]: Start difference. First operand 114942 states and 140638 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:05,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:25:05,930 INFO L93 Difference]: Finished difference Result 229777 states and 280434 transitions. [2025-03-16 19:25:05,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:25:05,930 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2025-03-16 19:25:05,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:25:06,064 INFO L225 Difference]: With dead ends: 229777 [2025-03-16 19:25:06,064 INFO L226 Difference]: Without dead ends: 115204 [2025-03-16 19:25:06,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:25:06,474 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 293 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:25:06,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 351 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:25:06,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115204 states. [2025-03-16 19:25:07,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115204 to 107262. [2025-03-16 19:25:07,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107262 states, 107261 states have (on average 1.1966138671092008) internal successors, (128350), 107261 states have internal predecessors, (128350), 0 states have call successors, (0), 0 states 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:25:07,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107262 states to 107262 states and 128350 transitions. [2025-03-16 19:25:07,537 INFO L78 Accepts]: Start accepts. Automaton has 107262 states and 128350 transitions. Word has length 103 [2025-03-16 19:25:07,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:25:07,537 INFO L471 AbstractCegarLoop]: Abstraction has 107262 states and 128350 transitions. [2025-03-16 19:25:07,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:07,537 INFO L276 IsEmpty]: Start isEmpty. Operand 107262 states and 128350 transitions. [2025-03-16 19:25:07,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-16 19:25:07,546 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:25:07,546 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:25:07,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-16 19:25:07,546 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:25:07,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:25:07,547 INFO L85 PathProgramCache]: Analyzing trace with hash 957161002, now seen corresponding path program 1 times [2025-03-16 19:25:07,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:25:07,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463712704] [2025-03-16 19:25:07,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:07,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:25:07,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-16 19:25:07,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-16 19:25:07,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:07,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:08,093 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:08,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:25:08,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463712704] [2025-03-16 19:25:08,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463712704] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:25:08,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904181979] [2025-03-16 19:25:08,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:08,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:25:08,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:25:08,095 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:25:08,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 19:25:08,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-16 19:25:08,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-16 19:25:08,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:08,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:08,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-16 19:25:08,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:25:08,869 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:08,870 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:25:08,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904181979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:25:08,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 19:25:08,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [14] total 27 [2025-03-16 19:25:08,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664422066] [2025-03-16 19:25:08,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:25:08,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-16 19:25:08,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:25:08,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-16 19:25:08,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=684, Unknown=0, NotChecked=0, Total=756 [2025-03-16 19:25:08,871 INFO L87 Difference]: Start difference. First operand 107262 states and 128350 transitions. Second operand has 15 states, 15 states have (on average 7.066666666666666) internal successors, (106), 14 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:10,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:25:10,427 INFO L93 Difference]: Finished difference Result 296008 states and 353952 transitions. [2025-03-16 19:25:10,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-16 19:25:10,427 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.066666666666666) internal successors, (106), 14 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2025-03-16 19:25:10,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:25:10,774 INFO L225 Difference]: With dead ends: 296008 [2025-03-16 19:25:10,774 INFO L226 Difference]: Without dead ends: 245806 [2025-03-16 19:25:10,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=278, Invalid=1978, Unknown=0, NotChecked=0, Total=2256 [2025-03-16 19:25:10,841 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 1399 mSDsluCounter, 2202 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1399 SdHoareTripleChecker+Valid, 2452 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:25:10,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1399 Valid, 2452 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:25:11,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245806 states. [2025-03-16 19:25:12,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245806 to 123946. [2025-03-16 19:25:12,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123946 states, 123945 states have (on average 1.1955464117148735) internal successors, (148182), 123945 states have internal predecessors, (148182), 0 states have call successors, (0), 0 states 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:25:12,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123946 states to 123946 states and 148182 transitions. [2025-03-16 19:25:12,969 INFO L78 Accepts]: Start accepts. Automaton has 123946 states and 148182 transitions. Word has length 106 [2025-03-16 19:25:12,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:25:12,969 INFO L471 AbstractCegarLoop]: Abstraction has 123946 states and 148182 transitions. [2025-03-16 19:25:12,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.066666666666666) internal successors, (106), 14 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:12,969 INFO L276 IsEmpty]: Start isEmpty. Operand 123946 states and 148182 transitions. [2025-03-16 19:25:12,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-16 19:25:12,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:25:12,976 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:25:12,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-16 19:25:13,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-03-16 19:25:13,176 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:25:13,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:25:13,177 INFO L85 PathProgramCache]: Analyzing trace with hash -870678315, now seen corresponding path program 1 times [2025-03-16 19:25:13,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:25:13,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261970455] [2025-03-16 19:25:13,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:13,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:25:13,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-16 19:25:13,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-16 19:25:13,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:13,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:13,583 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:13,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:25:13,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261970455] [2025-03-16 19:25:13,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261970455] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:25:13,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605859357] [2025-03-16 19:25:13,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:13,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:25:13,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:25:13,588 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:25:13,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 19:25:13,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-16 19:25:13,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-16 19:25:13,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:13,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:13,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-16 19:25:13,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:25:14,687 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:14,688 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:25:15,237 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:15,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605859357] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:25:15,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:25:15,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 13] total 39 [2025-03-16 19:25:15,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89254262] [2025-03-16 19:25:15,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:25:15,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-16 19:25:15,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:25:15,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-16 19:25:15,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1363, Unknown=0, NotChecked=0, Total=1482 [2025-03-16 19:25:15,239 INFO L87 Difference]: Start difference. First operand 123946 states and 148182 transitions. Second operand has 39 states, 39 states have (on average 7.538461538461538) internal successors, (294), 39 states have internal predecessors, (294), 0 states have call successors, (0), 0 states 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:25:23,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:25:23,619 INFO L93 Difference]: Finished difference Result 429468 states and 512329 transitions. [2025-03-16 19:25:23,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2025-03-16 19:25:23,620 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 7.538461538461538) internal successors, (294), 39 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2025-03-16 19:25:23,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:25:24,116 INFO L225 Difference]: With dead ends: 429468 [2025-03-16 19:25:24,116 INFO L226 Difference]: Without dead ends: 389238 [2025-03-16 19:25:24,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6575 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=2924, Invalid=19128, Unknown=0, NotChecked=0, Total=22052 [2025-03-16 19:25:24,228 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 3215 mSDsluCounter, 5995 mSDsCounter, 0 mSdLazyCounter, 6165 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3215 SdHoareTripleChecker+Valid, 6216 SdHoareTripleChecker+Invalid, 6221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 6165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:25:24,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3215 Valid, 6216 Invalid, 6221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 6165 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 19:25:24,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389238 states. [2025-03-16 19:25:26,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389238 to 124145. [2025-03-16 19:25:26,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124145 states, 124144 states have (on average 1.1954665549684238) internal successors, (148410), 124144 states have internal predecessors, (148410), 0 states have call successors, (0), 0 states 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:25:26,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124145 states to 124145 states and 148410 transitions. [2025-03-16 19:25:26,934 INFO L78 Accepts]: Start accepts. Automaton has 124145 states and 148410 transitions. Word has length 106 [2025-03-16 19:25:26,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:25:26,934 INFO L471 AbstractCegarLoop]: Abstraction has 124145 states and 148410 transitions. [2025-03-16 19:25:26,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 7.538461538461538) internal successors, (294), 39 states have internal predecessors, (294), 0 states have call successors, (0), 0 states 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:25:26,934 INFO L276 IsEmpty]: Start isEmpty. Operand 124145 states and 148410 transitions. [2025-03-16 19:25:26,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-16 19:25:26,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:25:26,939 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:25:26,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-16 19:25:27,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-03-16 19:25:27,140 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:25:27,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:25:27,140 INFO L85 PathProgramCache]: Analyzing trace with hash 459913313, now seen corresponding path program 1 times [2025-03-16 19:25:27,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:25:27,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73100509] [2025-03-16 19:25:27,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:27,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:25:27,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-16 19:25:27,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-16 19:25:27,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:27,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:27,312 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:27,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:25:27,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73100509] [2025-03-16 19:25:27,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73100509] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:25:27,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969572147] [2025-03-16 19:25:27,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:27,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:25:27,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:25:27,315 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:25:27,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-16 19:25:27,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-16 19:25:27,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-16 19:25:27,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:27,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:27,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-16 19:25:27,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:25:28,748 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:28,748 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:25:29,183 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:29,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969572147] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:25:29,183 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:25:29,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14, 12] total 28 [2025-03-16 19:25:29,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260064359] [2025-03-16 19:25:29,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:25:29,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-16 19:25:29,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:25:29,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-16 19:25:29,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=651, Unknown=0, NotChecked=0, Total=756 [2025-03-16 19:25:29,184 INFO L87 Difference]: Start difference. First operand 124145 states and 148410 transitions. Second operand has 28 states, 28 states have (on average 9.321428571428571) internal successors, (261), 28 states have internal predecessors, (261), 0 states have call successors, (0), 0 states 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:25:31,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:25:31,324 INFO L93 Difference]: Finished difference Result 350800 states and 418951 transitions. [2025-03-16 19:25:31,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-16 19:25:31,325 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 9.321428571428571) internal successors, (261), 28 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2025-03-16 19:25:31,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:25:31,662 INFO L225 Difference]: With dead ends: 350800 [2025-03-16 19:25:31,662 INFO L226 Difference]: Without dead ends: 259986 [2025-03-16 19:25:31,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=388, Invalid=1774, Unknown=0, NotChecked=0, Total=2162 [2025-03-16 19:25:31,766 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 1575 mSDsluCounter, 2462 mSDsCounter, 0 mSdLazyCounter, 1981 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1575 SdHoareTripleChecker+Valid, 2651 SdHoareTripleChecker+Invalid, 2001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 19:25:31,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1575 Valid, 2651 Invalid, 2001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1981 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 19:25:31,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259986 states. [2025-03-16 19:25:33,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259986 to 124584. [2025-03-16 19:25:33,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124584 states, 124583 states have (on average 1.1953637334146714) internal successors, (148922), 124583 states have internal predecessors, (148922), 0 states have call successors, (0), 0 states 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:25:33,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124584 states to 124584 states and 148922 transitions. [2025-03-16 19:25:33,709 INFO L78 Accepts]: Start accepts. Automaton has 124584 states and 148922 transitions. Word has length 107 [2025-03-16 19:25:33,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:25:33,710 INFO L471 AbstractCegarLoop]: Abstraction has 124584 states and 148922 transitions. [2025-03-16 19:25:33,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 9.321428571428571) internal successors, (261), 28 states have internal predecessors, (261), 0 states have call successors, (0), 0 states 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:25:33,710 INFO L276 IsEmpty]: Start isEmpty. Operand 124584 states and 148922 transitions. [2025-03-16 19:25:33,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-16 19:25:33,715 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:25:33,715 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 19:25:33,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-16 19:25:33,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:25:33,920 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:25:33,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:25:33,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1336597680, now seen corresponding path program 1 times [2025-03-16 19:25:33,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:25:33,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104765461] [2025-03-16 19:25:33,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:33,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:25:33,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-16 19:25:33,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-16 19:25:33,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:33,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:33,951 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:33,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:25:33,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104765461] [2025-03-16 19:25:33,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104765461] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:25:33,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:25:33,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:25:33,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541248850] [2025-03-16 19:25:33,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:25:33,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:25:33,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:25:33,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:25:33,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:25:33,953 INFO L87 Difference]: Start difference. First operand 124584 states and 148922 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:34,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:25:34,310 INFO L93 Difference]: Finished difference Result 197898 states and 236115 transitions. [2025-03-16 19:25:34,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:25:34,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2025-03-16 19:25:34,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:25:34,478 INFO L225 Difference]: With dead ends: 197898 [2025-03-16 19:25:34,478 INFO L226 Difference]: Without dead ends: 156598 [2025-03-16 19:25:34,871 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:25:34,871 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 69 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:25:34,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 384 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:25:34,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156598 states. [2025-03-16 19:25:35,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156598 to 126922. [2025-03-16 19:25:35,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126922 states, 126921 states have (on average 1.1877703453329236) internal successors, (150753), 126921 states have internal predecessors, (150753), 0 states have call successors, (0), 0 states 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:25:36,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126922 states to 126922 states and 150753 transitions. [2025-03-16 19:25:36,096 INFO L78 Accepts]: Start accepts. Automaton has 126922 states and 150753 transitions. Word has length 108 [2025-03-16 19:25:36,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:25:36,096 INFO L471 AbstractCegarLoop]: Abstraction has 126922 states and 150753 transitions. [2025-03-16 19:25:36,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:36,096 INFO L276 IsEmpty]: Start isEmpty. Operand 126922 states and 150753 transitions. [2025-03-16 19:25:36,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-16 19:25:36,102 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:25:36,102 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:25:36,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-16 19:25:36,102 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:25:36,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:25:36,102 INFO L85 PathProgramCache]: Analyzing trace with hash 2084118691, now seen corresponding path program 1 times [2025-03-16 19:25:36,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:25:36,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482317169] [2025-03-16 19:25:36,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:25:36,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:25:36,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-16 19:25:36,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-16 19:25:36,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:25:36,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:25:36,470 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:25:36,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:25:36,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482317169] [2025-03-16 19:25:36,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482317169] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:25:36,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:25:36,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-16 19:25:36,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989630005] [2025-03-16 19:25:36,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:25:36,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-16 19:25:36,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:25:36,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-16 19:25:36,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:25:36,471 INFO L87 Difference]: Start difference. First operand 126922 states and 150753 transitions. Second operand has 17 states, 17 states have (on average 6.352941176470588) internal successors, (108), 16 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:25:37,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:25:37,531 INFO L93 Difference]: Finished difference Result 144270 states and 171432 transitions. [2025-03-16 19:25:37,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-16 19:25:37,532 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.352941176470588) internal successors, (108), 16 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2025-03-16 19:25:37,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:25:37,675 INFO L225 Difference]: With dead ends: 144270 [2025-03-16 19:25:37,675 INFO L226 Difference]: Without dead ends: 119636 [2025-03-16 19:25:37,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=179, Invalid=813, Unknown=0, NotChecked=0, Total=992 [2025-03-16 19:25:37,725 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 752 mSDsluCounter, 2624 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 2874 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:25:37,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [752 Valid, 2874 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:25:37,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119636 states.