./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+cfa-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.8.1.ufo.UNBOUNDED.pals.c.v+cfa-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 e4ea09104fdfc6025836c8ea5917b899069d556f85aa19eff5395187d58ecb3d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:37:44,063 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:37:44,109 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:37:44,113 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:37:44,113 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:37:44,131 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:37:44,133 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:37:44,133 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:37:44,133 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:37:44,134 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:37:44,134 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:37:44,134 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:37:44,134 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:37:44,134 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:37:44,134 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:37:44,134 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:37:44,134 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:37:44,135 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:37:44,135 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:37:44,135 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:37:44,135 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:37:44,136 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:37:44,136 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:37:44,136 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:37:44,136 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:37:44,136 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:37:44,136 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:37:44,136 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:37:44,137 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:37:44,137 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:37:44,137 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:37:44,137 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:37:44,137 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:37:44,137 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:37:44,137 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:37:44,137 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:37:44,137 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:37:44,137 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:37:44,137 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:37:44,137 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:37:44,137 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:37:44,137 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:37:44,137 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:37:44,137 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 -> e4ea09104fdfc6025836c8ea5917b899069d556f85aa19eff5395187d58ecb3d [2025-03-16 19:37:44,341 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:37:44,348 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:37:44,349 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:37:44,350 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:37:44,350 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:37:44,352 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-03-16 19:37:45,484 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16b890c25/da193384c05c429a93aa4ee3aa778df3/FLAG5a70593b9 [2025-03-16 19:37:45,802 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:37:45,803 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-03-16 19:37:45,810 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16b890c25/da193384c05c429a93aa4ee3aa778df3/FLAG5a70593b9 [2025-03-16 19:37:46,065 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16b890c25/da193384c05c429a93aa4ee3aa778df3 [2025-03-16 19:37:46,067 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:37:46,067 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:37:46,068 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:37:46,068 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:37:46,071 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:37:46,071 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:37:46" (1/1) ... [2025-03-16 19:37:46,072 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6202de40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:37:46, skipping insertion in model container [2025-03-16 19:37:46,072 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:37:46" (1/1) ... [2025-03-16 19:37:46,104 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:37:46,278 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.8.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[8640,8653] [2025-03-16 19:37:46,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:37:46,333 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:37:46,374 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.8.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[8640,8653] [2025-03-16 19:37:46,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:37:46,403 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:37:46,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:37:46 WrapperNode [2025-03-16 19:37:46,404 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:37:46,404 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:37:46,405 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:37:46,405 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:37:46,408 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:37:46" (1/1) ... [2025-03-16 19:37:46,418 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:37:46" (1/1) ... [2025-03-16 19:37:46,440 INFO L138 Inliner]: procedures = 28, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 716 [2025-03-16 19:37:46,441 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:37:46,441 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:37:46,441 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:37:46,441 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:37:46,450 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:37:46" (1/1) ... [2025-03-16 19:37:46,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:37:46" (1/1) ... [2025-03-16 19:37:46,456 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:37:46" (1/1) ... [2025-03-16 19:37:46,473 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:37:46,474 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:37:46" (1/1) ... [2025-03-16 19:37:46,474 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:37:46" (1/1) ... [2025-03-16 19:37:46,479 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:37:46" (1/1) ... [2025-03-16 19:37:46,480 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:37:46" (1/1) ... [2025-03-16 19:37:46,481 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:37:46" (1/1) ... [2025-03-16 19:37:46,482 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:37:46" (1/1) ... [2025-03-16 19:37:46,484 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:37:46,485 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:37:46,485 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:37:46,485 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:37:46,485 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:37:46" (1/1) ... [2025-03-16 19:37:46,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:37:46,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:37:46,520 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:37:46,522 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:37:46,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:37:46,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:37:46,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:37:46,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:37:46,635 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:37:46,636 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:37:47,133 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L283: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-16 19:37:47,133 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L333: havoc main_~node4__m4~0#1; [2025-03-16 19:37:47,134 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L829: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-16 19:37:47,134 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L598: havoc main_~node6____CPAchecker_TMP_0~0#1; [2025-03-16 19:37:47,134 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L318: havoc main_~node3__m3~0#1; [2025-03-16 19:37:47,134 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L303: havoc main_~node2__m2~0#1; [2025-03-16 19:37:47,134 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L733: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-16 19:37:47,135 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L553: havoc main_~node7____CPAchecker_TMP_0~0#1; [2025-03-16 19:37:47,135 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L439: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-16 19:37:47,135 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L688: havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-03-16 19:37:47,135 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L508: havoc main_~node8____CPAchecker_TMP_0~0#1; [2025-03-16 19:37:47,135 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L393: havoc main_~node8__m8~0#1; [2025-03-16 19:37:47,135 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L378: havoc main_~node7__m7~0#1; [2025-03-16 19:37:47,135 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L643: havoc main_~node5____CPAchecker_TMP_0~0#1; [2025-03-16 19:37:47,135 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L363: havoc main_~node6__m6~0#1; [2025-03-16 19:37:47,135 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L348: havoc main_~node5__m5~0#1; [2025-03-16 19:37:47,135 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L778: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-16 19:37:47,163 INFO L? ?]: Removed 59 outVars from TransFormulas that were not future-live. [2025-03-16 19:37:47,163 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:37:47,177 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:37:47,179 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:37:47,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:37:47 BoogieIcfgContainer [2025-03-16 19:37:47,180 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:37:47,182 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:37:47,183 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:37:47,186 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:37:47,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:37:46" (1/3) ... [2025-03-16 19:37:47,187 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40e4148a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:37:47, skipping insertion in model container [2025-03-16 19:37:47,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:37:46" (2/3) ... [2025-03-16 19:37:47,187 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40e4148a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:37:47, skipping insertion in model container [2025-03-16 19:37:47,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:37:47" (3/3) ... [2025-03-16 19:37:47,189 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-03-16 19:37:47,199 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:37:47,200 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c that has 1 procedures, 158 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-16 19:37:47,249 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:37:47,258 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;@7ea92a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:37:47,258 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:37:47,261 INFO L276 IsEmpty]: Start isEmpty. Operand has 158 states, 156 states have (on average 1.7564102564102564) internal successors, (274), 157 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:47,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 19:37:47,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:47,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:47,270 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:37:47,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:47,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1107755623, now seen corresponding path program 1 times [2025-03-16 19:37:47,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:47,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527032755] [2025-03-16 19:37:47,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:47,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:47,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 19:37:47,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 19:37:47,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:47,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:47,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:37:47,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:47,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527032755] [2025-03-16 19:37:47,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527032755] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:47,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:47,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:37:47,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983460520] [2025-03-16 19:37:47,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:47,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:37:47,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:47,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:37:47,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:37:47,678 INFO L87 Difference]: Start difference. First operand has 158 states, 156 states have (on average 1.7564102564102564) internal successors, (274), 157 states have internal predecessors, (274), 0 states have call successors, (0), 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 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:47,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:47,728 INFO L93 Difference]: Finished difference Result 340 states and 559 transitions. [2025-03-16 19:37:47,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:37:47,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2025-03-16 19:37:47,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:47,736 INFO L225 Difference]: With dead ends: 340 [2025-03-16 19:37:47,737 INFO L226 Difference]: Without dead ends: 239 [2025-03-16 19:37:47,738 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:37:47,740 INFO L435 NwaCegarLoop]: 385 mSDtfsCounter, 186 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:47,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 540 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:37:47,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-03-16 19:37:47,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 237. [2025-03-16 19:37:47,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 236 states have (on average 1.4406779661016949) internal successors, (340), 236 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:47,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 340 transitions. [2025-03-16 19:37:47,769 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 340 transitions. Word has length 101 [2025-03-16 19:37:47,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:47,770 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 340 transitions. [2025-03-16 19:37:47,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:47,770 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 340 transitions. [2025-03-16 19:37:47,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-16 19:37:47,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:47,786 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:47,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:37:47,787 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:37:47,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:47,787 INFO L85 PathProgramCache]: Analyzing trace with hash -273661585, now seen corresponding path program 1 times [2025-03-16 19:37:47,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:47,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743016733] [2025-03-16 19:37:47,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:47,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:47,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-16 19:37:47,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-16 19:37:47,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:47,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:47,946 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:37:47,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:47,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743016733] [2025-03-16 19:37:47,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743016733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:47,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:47,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:37:47,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799830397] [2025-03-16 19:37:47,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:47,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:37:47,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:47,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:37:47,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:37:47,948 INFO L87 Difference]: Start difference. First operand 237 states and 340 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:47,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:47,981 INFO L93 Difference]: Finished difference Result 569 states and 868 transitions. [2025-03-16 19:37:47,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:37:47,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2025-03-16 19:37:47,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:47,984 INFO L225 Difference]: With dead ends: 569 [2025-03-16 19:37:47,984 INFO L226 Difference]: Without dead ends: 395 [2025-03-16 19:37:47,984 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:37:47,985 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 126 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:47,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 460 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:37:47,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2025-03-16 19:37:48,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 393. [2025-03-16 19:37:48,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 392 states have (on average 1.5) internal successors, (588), 392 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:48,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 588 transitions. [2025-03-16 19:37:48,002 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 588 transitions. Word has length 102 [2025-03-16 19:37:48,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:48,002 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 588 transitions. [2025-03-16 19:37:48,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:48,003 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 588 transitions. [2025-03-16 19:37:48,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-16 19:37:48,004 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:48,004 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:48,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:37:48,004 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:37:48,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:48,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1820138348, now seen corresponding path program 1 times [2025-03-16 19:37:48,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:48,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155735328] [2025-03-16 19:37:48,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:48,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:48,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-16 19:37:48,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-16 19:37:48,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:48,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:48,132 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:37:48,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:48,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155735328] [2025-03-16 19:37:48,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155735328] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:48,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:48,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:37:48,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522107536] [2025-03-16 19:37:48,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:48,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:37:48,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:48,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:37:48,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:37:48,134 INFO L87 Difference]: Start difference. First operand 393 states and 588 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:48,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:48,153 INFO L93 Difference]: Finished difference Result 1021 states and 1586 transitions. [2025-03-16 19:37:48,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:37:48,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2025-03-16 19:37:48,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:48,157 INFO L225 Difference]: With dead ends: 1021 [2025-03-16 19:37:48,157 INFO L226 Difference]: Without dead ends: 691 [2025-03-16 19:37:48,158 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:37:48,160 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 121 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:48,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 456 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:37:48,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2025-03-16 19:37:48,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 689. [2025-03-16 19:37:48,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 688 states have (on average 1.5348837209302326) internal successors, (1056), 688 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:48,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1056 transitions. [2025-03-16 19:37:48,190 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1056 transitions. Word has length 103 [2025-03-16 19:37:48,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:48,190 INFO L471 AbstractCegarLoop]: Abstraction has 689 states and 1056 transitions. [2025-03-16 19:37:48,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:48,191 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1056 transitions. [2025-03-16 19:37:48,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-16 19:37:48,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:48,193 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:48,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:37:48,194 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:37:48,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:48,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1631959620, now seen corresponding path program 1 times [2025-03-16 19:37:48,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:48,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369261658] [2025-03-16 19:37:48,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:48,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:48,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-16 19:37:48,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-16 19:37:48,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:48,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:48,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:48,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:48,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369261658] [2025-03-16 19:37:48,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369261658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:48,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:48,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:37:48,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985012743] [2025-03-16 19:37:48,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:48,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:37:48,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:48,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:37:48,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:37:48,320 INFO L87 Difference]: Start difference. First operand 689 states and 1056 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:48,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:48,345 INFO L93 Difference]: Finished difference Result 1877 states and 2938 transitions. [2025-03-16 19:37:48,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:37:48,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2025-03-16 19:37:48,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:48,350 INFO L225 Difference]: With dead ends: 1877 [2025-03-16 19:37:48,350 INFO L226 Difference]: Without dead ends: 1251 [2025-03-16 19:37:48,351 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:37:48,354 INFO L435 NwaCegarLoop]: 295 mSDtfsCounter, 116 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:48,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 452 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:37:48,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2025-03-16 19:37:48,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1249. [2025-03-16 19:37:48,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 1248 states have (on average 1.5512820512820513) internal successors, (1936), 1248 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:48,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1936 transitions. [2025-03-16 19:37:48,389 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 1936 transitions. Word has length 104 [2025-03-16 19:37:48,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:48,390 INFO L471 AbstractCegarLoop]: Abstraction has 1249 states and 1936 transitions. [2025-03-16 19:37:48,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:48,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1936 transitions. [2025-03-16 19:37:48,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-16 19:37:48,391 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:48,391 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:48,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:37:48,391 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:37:48,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:48,392 INFO L85 PathProgramCache]: Analyzing trace with hash 572098497, now seen corresponding path program 1 times [2025-03-16 19:37:48,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:48,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929877671] [2025-03-16 19:37:48,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:48,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:48,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-16 19:37:48,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-16 19:37:48,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:48,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:48,483 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:37:48,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:48,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929877671] [2025-03-16 19:37:48,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929877671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:48,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:48,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:37:48,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583060748] [2025-03-16 19:37:48,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:48,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:37:48,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:48,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:37:48,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:37:48,487 INFO L87 Difference]: Start difference. First operand 1249 states and 1936 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:48,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:48,510 INFO L93 Difference]: Finished difference Result 3493 states and 5474 transitions. [2025-03-16 19:37:48,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:37:48,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2025-03-16 19:37:48,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:48,518 INFO L225 Difference]: With dead ends: 3493 [2025-03-16 19:37:48,518 INFO L226 Difference]: Without dead ends: 2307 [2025-03-16 19:37:48,520 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:37:48,520 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 111 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:48,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 448 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:37:48,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2025-03-16 19:37:48,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2305. [2025-03-16 19:37:48,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2305 states, 2304 states have (on average 1.5555555555555556) internal successors, (3584), 2304 states have internal predecessors, (3584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:48,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2305 states to 2305 states and 3584 transitions. [2025-03-16 19:37:48,568 INFO L78 Accepts]: Start accepts. Automaton has 2305 states and 3584 transitions. Word has length 105 [2025-03-16 19:37:48,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:48,569 INFO L471 AbstractCegarLoop]: Abstraction has 2305 states and 3584 transitions. [2025-03-16 19:37:48,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:48,569 INFO L276 IsEmpty]: Start isEmpty. Operand 2305 states and 3584 transitions. [2025-03-16 19:37:48,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-16 19:37:48,570 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:48,570 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:48,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:37:48,570 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:37:48,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:48,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1265967881, now seen corresponding path program 1 times [2025-03-16 19:37:48,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:48,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177376366] [2025-03-16 19:37:48,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:48,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:48,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-16 19:37:48,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-16 19:37:48,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:48,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:48,671 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:37:48,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:48,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177376366] [2025-03-16 19:37:48,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177376366] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:48,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:48,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:37:48,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133223510] [2025-03-16 19:37:48,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:48,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:37:48,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:48,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:37:48,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:37:48,673 INFO L87 Difference]: Start difference. First operand 2305 states and 3584 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 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:37:48,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:48,707 INFO L93 Difference]: Finished difference Result 6533 states and 10210 transitions. [2025-03-16 19:37:48,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:37:48,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 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:37:48,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:48,719 INFO L225 Difference]: With dead ends: 6533 [2025-03-16 19:37:48,719 INFO L226 Difference]: Without dead ends: 4291 [2025-03-16 19:37:48,721 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:37:48,722 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 106 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:48,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 444 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:37:48,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4291 states. [2025-03-16 19:37:48,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4291 to 4289. [2025-03-16 19:37:48,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4289 states, 4288 states have (on average 1.5522388059701493) internal successors, (6656), 4288 states have internal predecessors, (6656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:48,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4289 states to 4289 states and 6656 transitions. [2025-03-16 19:37:48,800 INFO L78 Accepts]: Start accepts. Automaton has 4289 states and 6656 transitions. Word has length 106 [2025-03-16 19:37:48,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:48,800 INFO L471 AbstractCegarLoop]: Abstraction has 4289 states and 6656 transitions. [2025-03-16 19:37:48,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 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:37:48,801 INFO L276 IsEmpty]: Start isEmpty. Operand 4289 states and 6656 transitions. [2025-03-16 19:37:48,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-16 19:37:48,802 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:48,802 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:48,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:37:48,802 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:37:48,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:48,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1767566318, now seen corresponding path program 1 times [2025-03-16 19:37:48,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:48,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664782972] [2025-03-16 19:37:48,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:48,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:48,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-16 19:37:48,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-16 19:37:48,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:48,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:48,917 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:37:48,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:48,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664782972] [2025-03-16 19:37:48,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664782972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:48,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:48,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:37:48,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50516063] [2025-03-16 19:37:48,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:48,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:37:48,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:48,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:37:48,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:37:48,920 INFO L87 Difference]: Start difference. First operand 4289 states and 6656 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:48,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:48,977 INFO L93 Difference]: Finished difference Result 12229 states and 19010 transitions. [2025-03-16 19:37:48,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:37:48,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2025-03-16 19:37:48,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:49,000 INFO L225 Difference]: With dead ends: 12229 [2025-03-16 19:37:49,001 INFO L226 Difference]: Without dead ends: 8003 [2025-03-16 19:37:49,007 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:37:49,008 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 101 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:49,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 440 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:37:49,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8003 states. [2025-03-16 19:37:49,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8003 to 8001. [2025-03-16 19:37:49,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8001 states, 8000 states have (on average 1.544) internal successors, (12352), 8000 states have internal predecessors, (12352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:49,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8001 states to 8001 states and 12352 transitions. [2025-03-16 19:37:49,157 INFO L78 Accepts]: Start accepts. Automaton has 8001 states and 12352 transitions. Word has length 107 [2025-03-16 19:37:49,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:49,157 INFO L471 AbstractCegarLoop]: Abstraction has 8001 states and 12352 transitions. [2025-03-16 19:37:49,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:49,157 INFO L276 IsEmpty]: Start isEmpty. Operand 8001 states and 12352 transitions. [2025-03-16 19:37:49,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-16 19:37:49,158 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:49,158 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:49,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:37:49,158 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:37:49,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:49,158 INFO L85 PathProgramCache]: Analyzing trace with hash 745199958, now seen corresponding path program 1 times [2025-03-16 19:37:49,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:49,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510411573] [2025-03-16 19:37:49,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:49,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:49,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-16 19:37:49,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-16 19:37:49,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:49,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:49,377 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:37:49,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:49,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510411573] [2025-03-16 19:37:49,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510411573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:49,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:49,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 19:37:49,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208789916] [2025-03-16 19:37:49,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:49,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 19:37:49,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:49,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 19:37:49,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-16 19:37:49,378 INFO L87 Difference]: Start difference. First operand 8001 states and 12352 transitions. Second operand has 10 states, 10 states have (on average 10.8) internal successors, (108), 10 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:37:50,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:50,239 INFO L93 Difference]: Finished difference Result 135009 states and 208976 transitions. [2025-03-16 19:37:50,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 19:37:50,240 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.8) internal successors, (108), 10 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:37:50,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:50,462 INFO L225 Difference]: With dead ends: 135009 [2025-03-16 19:37:50,463 INFO L226 Difference]: Without dead ends: 127071 [2025-03-16 19:37:50,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2025-03-16 19:37:50,486 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 2641 mSDsluCounter, 6729 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2641 SdHoareTripleChecker+Valid, 6934 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:50,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2641 Valid, 6934 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:37:50,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127071 states. [2025-03-16 19:37:51,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127071 to 15937. [2025-03-16 19:37:51,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15937 states, 15936 states have (on average 1.5301204819277108) internal successors, (24384), 15936 states have internal predecessors, (24384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:51,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15937 states to 15937 states and 24384 transitions. [2025-03-16 19:37:51,448 INFO L78 Accepts]: Start accepts. Automaton has 15937 states and 24384 transitions. Word has length 108 [2025-03-16 19:37:51,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:51,448 INFO L471 AbstractCegarLoop]: Abstraction has 15937 states and 24384 transitions. [2025-03-16 19:37:51,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.8) internal successors, (108), 10 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:37:51,449 INFO L276 IsEmpty]: Start isEmpty. Operand 15937 states and 24384 transitions. [2025-03-16 19:37:51,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-16 19:37:51,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:51,450 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:51,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:37:51,450 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:37:51,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:51,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1083497185, now seen corresponding path program 1 times [2025-03-16 19:37:51,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:51,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916800962] [2025-03-16 19:37:51,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:51,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:51,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-16 19:37:51,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-16 19:37:51,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:51,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:51,574 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:37:51,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:51,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916800962] [2025-03-16 19:37:51,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916800962] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:51,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:51,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:37:51,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235016086] [2025-03-16 19:37:51,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:51,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:37:51,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:51,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:37:51,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:37:51,577 INFO L87 Difference]: Start difference. First operand 15937 states and 24384 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:51,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:51,740 INFO L93 Difference]: Finished difference Result 46277 states and 70594 transitions. [2025-03-16 19:37:51,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:37:51,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-16 19:37:51,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:51,782 INFO L225 Difference]: With dead ends: 46277 [2025-03-16 19:37:51,782 INFO L226 Difference]: Without dead ends: 30403 [2025-03-16 19:37:51,792 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:37:51,794 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 91 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 345 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:37:51,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 345 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:37:51,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30403 states. [2025-03-16 19:37:52,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30403 to 30145. [2025-03-16 19:37:52,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30145 states, 30144 states have (on average 1.505307855626327) internal successors, (45376), 30144 states have internal predecessors, (45376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:52,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30145 states to 30145 states and 45376 transitions. [2025-03-16 19:37:52,180 INFO L78 Accepts]: Start accepts. Automaton has 30145 states and 45376 transitions. Word has length 110 [2025-03-16 19:37:52,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:52,181 INFO L471 AbstractCegarLoop]: Abstraction has 30145 states and 45376 transitions. [2025-03-16 19:37:52,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:52,181 INFO L276 IsEmpty]: Start isEmpty. Operand 30145 states and 45376 transitions. [2025-03-16 19:37:52,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-16 19:37:52,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:52,182 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:52,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:37:52,182 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:37:52,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:52,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1082335336, now seen corresponding path program 1 times [2025-03-16 19:37:52,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:52,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619309564] [2025-03-16 19:37:52,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:52,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:52,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-16 19:37:52,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-16 19:37:52,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:52,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:52,698 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:37:52,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:52,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619309564] [2025-03-16 19:37:52,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619309564] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:52,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:52,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 19:37:52,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571341097] [2025-03-16 19:37:52,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:52,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 19:37:52,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:52,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 19:37:52,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-16 19:37:52,700 INFO L87 Difference]: Start difference. First operand 30145 states and 45376 transitions. Second operand has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:53,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:53,219 INFO L93 Difference]: Finished difference Result 60229 states and 90690 transitions. [2025-03-16 19:37:53,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 19:37:53,219 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-16 19:37:53,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:53,253 INFO L225 Difference]: With dead ends: 60229 [2025-03-16 19:37:53,254 INFO L226 Difference]: Without dead ends: 30147 [2025-03-16 19:37:53,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2025-03-16 19:37:53,285 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 820 mSDsluCounter, 1004 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:53,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 1204 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:37:53,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30147 states. [2025-03-16 19:37:53,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30147 to 30145. [2025-03-16 19:37:53,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30145 states, 30144 states have (on average 1.4968152866242037) internal successors, (45120), 30144 states have internal predecessors, (45120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:53,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30145 states to 30145 states and 45120 transitions. [2025-03-16 19:37:53,708 INFO L78 Accepts]: Start accepts. Automaton has 30145 states and 45120 transitions. Word has length 110 [2025-03-16 19:37:53,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:53,708 INFO L471 AbstractCegarLoop]: Abstraction has 30145 states and 45120 transitions. [2025-03-16 19:37:53,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:53,708 INFO L276 IsEmpty]: Start isEmpty. Operand 30145 states and 45120 transitions. [2025-03-16 19:37:53,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 19:37:53,709 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:53,709 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:53,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:37:53,709 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:37:53,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:53,710 INFO L85 PathProgramCache]: Analyzing trace with hash 808298262, now seen corresponding path program 1 times [2025-03-16 19:37:53,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:53,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487753675] [2025-03-16 19:37:53,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:53,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:53,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 19:37:53,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 19:37:53,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:53,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:54,063 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:37:54,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:54,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487753675] [2025-03-16 19:37:54,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487753675] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:54,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:54,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:37:54,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462748973] [2025-03-16 19:37:54,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:54,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:37:54,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:54,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:37:54,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:37:54,065 INFO L87 Difference]: Start difference. First operand 30145 states and 45120 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:54,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:54,131 INFO L93 Difference]: Finished difference Result 30659 states and 45889 transitions. [2025-03-16 19:37:54,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:37:54,132 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-03-16 19:37:54,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:54,164 INFO L225 Difference]: With dead ends: 30659 [2025-03-16 19:37:54,165 INFO L226 Difference]: Without dead ends: 30657 [2025-03-16 19:37:54,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:37:54,176 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 0 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:54,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 813 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:37:54,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30657 states. [2025-03-16 19:37:54,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30657 to 30657. [2025-03-16 19:37:54,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30657 states, 30656 states have (on average 1.4843423799582462) internal successors, (45504), 30656 states have internal predecessors, (45504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:54,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30657 states to 30657 states and 45504 transitions. [2025-03-16 19:37:54,474 INFO L78 Accepts]: Start accepts. Automaton has 30657 states and 45504 transitions. Word has length 111 [2025-03-16 19:37:54,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:54,474 INFO L471 AbstractCegarLoop]: Abstraction has 30657 states and 45504 transitions. [2025-03-16 19:37:54,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:54,475 INFO L276 IsEmpty]: Start isEmpty. Operand 30657 states and 45504 transitions. [2025-03-16 19:37:54,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 19:37:54,475 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:54,476 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:54,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:37:54,476 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:37:54,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:54,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1537645205, now seen corresponding path program 1 times [2025-03-16 19:37:54,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:54,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60955633] [2025-03-16 19:37:54,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:54,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:54,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 19:37:54,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 19:37:54,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:54,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:54,542 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:37:54,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:54,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60955633] [2025-03-16 19:37:54,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60955633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:54,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:54,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:37:54,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465159575] [2025-03-16 19:37:54,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:54,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:37:54,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:54,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:37:54,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:37:54,544 INFO L87 Difference]: Start difference. First operand 30657 states and 45504 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:54,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:54,667 INFO L93 Difference]: Finished difference Result 60872 states and 90822 transitions. [2025-03-16 19:37:54,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:37:54,667 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-03-16 19:37:54,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:54,723 INFO L225 Difference]: With dead ends: 60872 [2025-03-16 19:37:54,723 INFO L226 Difference]: Without dead ends: 44485 [2025-03-16 19:37:54,745 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:37:54,746 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 133 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:54,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 472 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:37:54,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44485 states. [2025-03-16 19:37:55,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44485 to 44483. [2025-03-16 19:37:55,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44483 states, 44482 states have (on average 1.4805539319275212) internal successors, (65858), 44482 states have internal predecessors, (65858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:55,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44483 states to 44483 states and 65858 transitions. [2025-03-16 19:37:55,278 INFO L78 Accepts]: Start accepts. Automaton has 44483 states and 65858 transitions. Word has length 111 [2025-03-16 19:37:55,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:55,278 INFO L471 AbstractCegarLoop]: Abstraction has 44483 states and 65858 transitions. [2025-03-16 19:37:55,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:55,278 INFO L276 IsEmpty]: Start isEmpty. Operand 44483 states and 65858 transitions. [2025-03-16 19:37:55,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-16 19:37:55,289 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:55,289 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:55,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:37:55,289 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:37:55,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:55,290 INFO L85 PathProgramCache]: Analyzing trace with hash -130315617, now seen corresponding path program 1 times [2025-03-16 19:37:55,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:55,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108424016] [2025-03-16 19:37:55,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:55,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:55,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-16 19:37:55,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-16 19:37:55,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:55,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:55,518 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 19:37:55,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:55,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108424016] [2025-03-16 19:37:55,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108424016] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:55,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:55,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 19:37:55,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752766998] [2025-03-16 19:37:55,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:55,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 19:37:55,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:55,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 19:37:55,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-16 19:37:55,520 INFO L87 Difference]: Start difference. First operand 44483 states and 65858 transitions. Second operand has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:56,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:56,665 INFO L93 Difference]: Finished difference Result 407893 states and 603851 transitions. [2025-03-16 19:37:56,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 19:37:56,665 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 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 150 [2025-03-16 19:37:56,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:57,145 INFO L225 Difference]: With dead ends: 407893 [2025-03-16 19:37:57,145 INFO L226 Difference]: Without dead ends: 363475 [2025-03-16 19:37:57,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:37:57,241 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 2296 mSDsluCounter, 2804 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2296 SdHoareTripleChecker+Valid, 3159 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:57,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2296 Valid, 3159 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:37:57,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363475 states. [2025-03-16 19:37:59,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363475 to 88899. [2025-03-16 19:37:59,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88899 states, 88898 states have (on average 1.4765911494071857) internal successors, (131266), 88898 states have internal predecessors, (131266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:59,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88899 states to 88899 states and 131266 transitions. [2025-03-16 19:37:59,841 INFO L78 Accepts]: Start accepts. Automaton has 88899 states and 131266 transitions. Word has length 150 [2025-03-16 19:37:59,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:59,841 INFO L471 AbstractCegarLoop]: Abstraction has 88899 states and 131266 transitions. [2025-03-16 19:37:59,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:59,842 INFO L276 IsEmpty]: Start isEmpty. Operand 88899 states and 131266 transitions. [2025-03-16 19:37:59,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-16 19:37:59,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:59,856 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:59,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:37:59,857 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:37:59,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:59,857 INFO L85 PathProgramCache]: Analyzing trace with hash 709435871, now seen corresponding path program 1 times [2025-03-16 19:37:59,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:59,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78085086] [2025-03-16 19:37:59,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:59,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:59,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-16 19:37:59,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-16 19:37:59,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:59,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:00,281 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-16 19:38:00,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:00,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78085086] [2025-03-16 19:38:00,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78085086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:00,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:00,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 19:38:00,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483857096] [2025-03-16 19:38:00,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:00,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 19:38:00,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:00,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 19:38:00,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-16 19:38:00,282 INFO L87 Difference]: Start difference. First operand 88899 states and 131266 transitions. Second operand has 10 states, 10 states have (on average 14.2) internal successors, (142), 10 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:01,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:01,382 INFO L93 Difference]: Finished difference Result 452309 states and 669259 transitions. [2025-03-16 19:38:01,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 19:38:01,382 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 14.2) internal successors, (142), 10 states have internal predecessors, (142), 0 states have call successors, (0), 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 150 [2025-03-16 19:38:01,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:02,141 INFO L225 Difference]: With dead ends: 452309 [2025-03-16 19:38:02,141 INFO L226 Difference]: Without dead ends: 407891 [2025-03-16 19:38:02,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:38:02,212 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 2354 mSDsluCounter, 2744 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2354 SdHoareTripleChecker+Valid, 3097 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:02,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2354 Valid, 3097 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:38:02,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407891 states. [2025-03-16 19:38:05,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407891 to 155587. [2025-03-16 19:38:05,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155587 states, 155586 states have (on average 1.472227578316815) internal successors, (229058), 155586 states have internal predecessors, (229058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:05,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155587 states to 155587 states and 229058 transitions. [2025-03-16 19:38:05,494 INFO L78 Accepts]: Start accepts. Automaton has 155587 states and 229058 transitions. Word has length 150 [2025-03-16 19:38:05,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:05,494 INFO L471 AbstractCegarLoop]: Abstraction has 155587 states and 229058 transitions. [2025-03-16 19:38:05,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.2) internal successors, (142), 10 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:05,494 INFO L276 IsEmpty]: Start isEmpty. Operand 155587 states and 229058 transitions. [2025-03-16 19:38:05,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-16 19:38:05,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:05,509 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:05,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:38:05,509 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:05,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:05,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1476647553, now seen corresponding path program 1 times [2025-03-16 19:38:05,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:05,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387343799] [2025-03-16 19:38:05,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:05,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:05,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-16 19:38:05,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-16 19:38:05,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:05,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:05,774 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-16 19:38:05,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:05,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387343799] [2025-03-16 19:38:05,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387343799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:05,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:05,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 19:38:05,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450982364] [2025-03-16 19:38:05,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:05,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 19:38:05,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:05,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 19:38:05,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-16 19:38:05,775 INFO L87 Difference]: Start difference. First operand 155587 states and 229058 transitions. Second operand has 10 states, 10 states have (on average 14.1) internal successors, (141), 10 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:07,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:07,973 INFO L93 Difference]: Finished difference Result 496725 states and 734667 transitions. [2025-03-16 19:38:07,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 19:38:07,974 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 14.1) internal successors, (141), 10 states have internal predecessors, (141), 0 states have call successors, (0), 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 150 [2025-03-16 19:38:07,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:08,621 INFO L225 Difference]: With dead ends: 496725 [2025-03-16 19:38:08,621 INFO L226 Difference]: Without dead ends: 452307 [2025-03-16 19:38:08,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:38:08,713 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 2445 mSDsluCounter, 2538 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2445 SdHoareTripleChecker+Valid, 2888 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:08,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2445 Valid, 2888 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:38:08,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452307 states. [2025-03-16 19:38:12,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452307 to 200003. [2025-03-16 19:38:12,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200003 states, 200002 states have (on average 1.4723152768472316) internal successors, (294466), 200002 states have internal predecessors, (294466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:13,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200003 states to 200003 states and 294466 transitions. [2025-03-16 19:38:13,251 INFO L78 Accepts]: Start accepts. Automaton has 200003 states and 294466 transitions. Word has length 150 [2025-03-16 19:38:13,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:13,251 INFO L471 AbstractCegarLoop]: Abstraction has 200003 states and 294466 transitions. [2025-03-16 19:38:13,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.1) internal successors, (141), 10 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:13,251 INFO L276 IsEmpty]: Start isEmpty. Operand 200003 states and 294466 transitions. [2025-03-16 19:38:13,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-16 19:38:13,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:13,265 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:13,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:38:13,270 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:13,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:13,270 INFO L85 PathProgramCache]: Analyzing trace with hash 167901471, now seen corresponding path program 1 times [2025-03-16 19:38:13,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:13,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634559915] [2025-03-16 19:38:13,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:13,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:13,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-16 19:38:13,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-16 19:38:13,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:13,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:13,510 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-16 19:38:13,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:13,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634559915] [2025-03-16 19:38:13,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634559915] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:13,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:13,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 19:38:13,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031883610] [2025-03-16 19:38:13,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:13,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 19:38:13,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:13,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 19:38:13,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-16 19:38:13,513 INFO L87 Difference]: Start difference. First operand 200003 states and 294466 transitions. Second operand has 10 states, 10 states have (on average 14.0) internal successors, (140), 10 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:15,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:15,166 INFO L93 Difference]: Finished difference Result 541141 states and 800075 transitions. [2025-03-16 19:38:15,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 19:38:15,167 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 14.0) internal successors, (140), 10 states have internal predecessors, (140), 0 states have call successors, (0), 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 150 [2025-03-16 19:38:15,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:15,909 INFO L225 Difference]: With dead ends: 541141 [2025-03-16 19:38:15,909 INFO L226 Difference]: Without dead ends: 496723 [2025-03-16 19:38:16,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:38:16,473 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 2528 mSDsluCounter, 2488 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2528 SdHoareTripleChecker+Valid, 2836 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:16,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2528 Valid, 2836 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:38:16,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496723 states. [2025-03-16 19:38:20,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496723 to 244419. [2025-03-16 19:38:20,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244419 states, 244418 states have (on average 1.472371101964667) internal successors, (359874), 244418 states have internal predecessors, (359874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:21,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244419 states to 244419 states and 359874 transitions. [2025-03-16 19:38:21,266 INFO L78 Accepts]: Start accepts. Automaton has 244419 states and 359874 transitions. Word has length 150 [2025-03-16 19:38:21,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:21,266 INFO L471 AbstractCegarLoop]: Abstraction has 244419 states and 359874 transitions. [2025-03-16 19:38:21,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.0) internal successors, (140), 10 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:21,266 INFO L276 IsEmpty]: Start isEmpty. Operand 244419 states and 359874 transitions. [2025-03-16 19:38:21,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-16 19:38:21,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:21,283 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:21,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:38:21,283 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:21,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:21,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1975345985, now seen corresponding path program 1 times [2025-03-16 19:38:21,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:21,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294293506] [2025-03-16 19:38:21,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:21,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:21,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-16 19:38:21,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-16 19:38:21,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:21,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:21,845 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-16 19:38:21,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:21,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294293506] [2025-03-16 19:38:21,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294293506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:21,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:21,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 19:38:21,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462299387] [2025-03-16 19:38:21,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:21,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 19:38:21,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:21,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 19:38:21,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-16 19:38:21,847 INFO L87 Difference]: Start difference. First operand 244419 states and 359874 transitions. Second operand has 10 states, 10 states have (on average 13.9) internal successors, (139), 10 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:24,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:24,019 INFO L93 Difference]: Finished difference Result 585557 states and 865483 transitions. [2025-03-16 19:38:24,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 19:38:24,022 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.9) internal successors, (139), 10 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2025-03-16 19:38:24,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:24,771 INFO L225 Difference]: With dead ends: 585557 [2025-03-16 19:38:24,771 INFO L226 Difference]: Without dead ends: 541139 [2025-03-16 19:38:24,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:38:24,838 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 2624 mSDsluCounter, 2572 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2624 SdHoareTripleChecker+Valid, 2918 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:24,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2624 Valid, 2918 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:38:25,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541139 states. [2025-03-16 19:38:29,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541139 to 288835. [2025-03-16 19:38:29,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288835 states, 288834 states have (on average 1.4724097578539923) internal successors, (425282), 288834 states have internal predecessors, (425282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)