./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.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 d07f8866cb9bb11c792ba110404f1fc964b1e4b380540b8d73177141eae78bfc --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:09:35,081 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:09:35,130 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:09:35,136 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:09:35,136 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:09:35,156 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:09:35,156 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:09:35,156 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:09:35,156 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:09:35,156 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:09:35,156 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:09:35,156 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:09:35,157 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:09:35,157 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:09:35,157 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:09:35,157 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:09:35,157 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:09:35,157 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:09:35,157 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:09:35,157 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:09:35,157 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:09:35,157 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:09:35,157 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:09:35,157 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:09:35,157 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:09:35,157 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:09:35,157 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:09:35,157 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:09:35,158 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:09:35,158 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:09:35,158 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:09:35,158 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:09:35,158 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:09:35,158 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:09:35,158 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:09:35,158 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:09:35,158 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:09:35,158 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:09:35,158 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:09:35,158 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:09:35,158 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:09:35,158 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:09:35,158 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:09:35,158 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 -> d07f8866cb9bb11c792ba110404f1fc964b1e4b380540b8d73177141eae78bfc [2025-03-03 15:09:35,382 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:09:35,393 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:09:35,395 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:09:35,396 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:09:35,396 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:09:35,397 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-03-03 15:09:36,568 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5138e557/e562ed4f46ea400bbc8281ad0ae635c0/FLAG78d60e529 [2025-03-03 15:09:36,847 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:09:36,847 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-03-03 15:09:36,858 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5138e557/e562ed4f46ea400bbc8281ad0ae635c0/FLAG78d60e529 [2025-03-03 15:09:37,158 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5138e557/e562ed4f46ea400bbc8281ad0ae635c0 [2025-03-03 15:09:37,160 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:09:37,165 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:09:37,171 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:09:37,171 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:09:37,181 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:09:37,182 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:09:37" (1/1) ... [2025-03-03 15:09:37,182 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51eca627 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:37, skipping insertion in model container [2025-03-03 15:09:37,184 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:09:37" (1/1) ... [2025-03-03 15:09:37,207 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:09:37,326 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[6358,6371] [2025-03-03 15:09:37,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:09:37,364 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:09:37,415 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[6358,6371] [2025-03-03 15:09:37,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:09:37,444 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:09:37,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:37 WrapperNode [2025-03-03 15:09:37,446 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:09:37,447 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:09:37,447 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:09:37,447 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:09:37,453 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:37" (1/1) ... [2025-03-03 15:09:37,460 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:37" (1/1) ... [2025-03-03 15:09:37,483 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 559 [2025-03-03 15:09:37,484 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:09:37,484 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:09:37,485 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:09:37,485 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:09:37,492 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:37" (1/1) ... [2025-03-03 15:09:37,492 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:37" (1/1) ... [2025-03-03 15:09:37,497 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:37" (1/1) ... [2025-03-03 15:09:37,511 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 15:09:37,512 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:37" (1/1) ... [2025-03-03 15:09:37,512 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:37" (1/1) ... [2025-03-03 15:09:37,517 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:37" (1/1) ... [2025-03-03 15:09:37,518 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:37" (1/1) ... [2025-03-03 15:09:37,519 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:37" (1/1) ... [2025-03-03 15:09:37,519 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:37" (1/1) ... [2025-03-03 15:09:37,521 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:09:37,522 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:09:37,522 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:09:37,522 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:09:37,523 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:37" (1/1) ... [2025-03-03 15:09:37,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:09:37,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:09:37,554 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 15:09:37,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 15:09:37,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:09:37,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:09:37,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:09:37,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:09:37,665 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:09:37,666 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:09:38,117 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L234: havoc main_~node3__m3~0#1; [2025-03-03 15:09:38,117 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L631: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-03 15:09:38,117 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L252: havoc main_~node4__m4~0#1; [2025-03-03 15:09:38,117 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L401: havoc main_~node5____CPAchecker_TMP_1~0#1; [2025-03-03 15:09:38,118 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L270: havoc main_~node5__m5~0#1; [2025-03-03 15:09:38,118 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L487: havoc main_~node4____CPAchecker_TMP_1~0#1; [2025-03-03 15:09:38,118 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L373: havoc main_~node5____CPAchecker_TMP_0~0#1; [2025-03-03 15:09:38,118 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L193: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-03 15:09:38,118 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L573: havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-03-03 15:09:38,118 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L309: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-03 15:09:38,118 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L722: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-03 15:09:38,118 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L459: havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-03-03 15:09:38,118 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L659: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-03-03 15:09:38,119 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L545: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-03 15:09:38,119 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L216: havoc main_~node2__m2~0#1; [2025-03-03 15:09:38,146 INFO L? ?]: Removed 50 outVars from TransFormulas that were not future-live. [2025-03-03 15:09:38,149 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:09:38,158 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:09:38,158 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:09:38,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:09:38 BoogieIcfgContainer [2025-03-03 15:09:38,158 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:09:38,161 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:09:38,162 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:09:38,165 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:09:38,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:09:37" (1/3) ... [2025-03-03 15:09:38,166 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c9efa3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:09:38, skipping insertion in model container [2025-03-03 15:09:38,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:37" (2/3) ... [2025-03-03 15:09:38,166 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c9efa3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:09:38, skipping insertion in model container [2025-03-03 15:09:38,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:09:38" (3/3) ... [2025-03-03 15:09:38,167 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-03-03 15:09:38,178 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:09:38,179 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c that has 1 procedures, 133 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-03 15:09:38,217 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:09:38,224 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;@77129b92, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:09:38,225 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 15:09:38,227 INFO L276 IsEmpty]: Start isEmpty. Operand has 133 states, 131 states have (on average 1.6946564885496183) internal successors, (222), 132 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:38,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-03 15:09:38,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:38,232 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:09:38,233 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:38,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:38,236 INFO L85 PathProgramCache]: Analyzing trace with hash -493986459, now seen corresponding path program 1 times [2025-03-03 15:09:38,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:38,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077206763] [2025-03-03 15:09:38,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:38,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:38,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 15:09:38,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 15:09:38,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:38,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:38,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:38,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:38,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077206763] [2025-03-03 15:09:38,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077206763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:38,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:38,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:09:38,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324419475] [2025-03-03 15:09:38,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:38,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:09:38,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:38,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:09:38,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:38,632 INFO L87 Difference]: Start difference. First operand has 133 states, 131 states have (on average 1.6946564885496183) internal successors, (222), 132 states have internal predecessors, (222), 0 states have call successors, (0), 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 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:38,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:38,692 INFO L93 Difference]: Finished difference Result 313 states and 504 transitions. [2025-03-03 15:09:38,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:09:38,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-03-03 15:09:38,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:38,701 INFO L225 Difference]: With dead ends: 313 [2025-03-03 15:09:38,701 INFO L226 Difference]: Without dead ends: 209 [2025-03-03 15:09:38,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:38,705 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 160 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:38,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 471 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:09:38,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-03-03 15:09:38,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2025-03-03 15:09:38,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 1.5) internal successors, (309), 206 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:38,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 309 transitions. [2025-03-03 15:09:38,739 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 309 transitions. Word has length 60 [2025-03-03 15:09:38,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:38,739 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 309 transitions. [2025-03-03 15:09:38,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:38,739 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 309 transitions. [2025-03-03 15:09:38,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 15:09:38,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:38,741 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:09:38,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:09:38,741 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:38,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:38,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1144303416, now seen corresponding path program 1 times [2025-03-03 15:09:38,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:38,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237567724] [2025-03-03 15:09:38,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:38,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:38,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 15:09:38,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 15:09:38,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:38,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:38,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:38,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:38,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237567724] [2025-03-03 15:09:38,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237567724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:38,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:38,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:09:38,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488975014] [2025-03-03 15:09:38,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:38,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:09:38,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:38,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:09:38,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:38,889 INFO L87 Difference]: Start difference. First operand 207 states and 309 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:38,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:38,934 INFO L93 Difference]: Finished difference Result 519 states and 805 transitions. [2025-03-03 15:09:38,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:09:38,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-03-03 15:09:38,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:38,936 INFO L225 Difference]: With dead ends: 519 [2025-03-03 15:09:38,936 INFO L226 Difference]: Without dead ends: 347 [2025-03-03 15:09:38,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:38,937 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 130 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:38,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 408 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:09:38,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-03-03 15:09:38,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 345. [2025-03-03 15:09:38,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 344 states have (on average 1.5348837209302326) internal successors, (528), 344 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:38,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 528 transitions. [2025-03-03 15:09:38,958 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 528 transitions. Word has length 61 [2025-03-03 15:09:38,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:38,958 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 528 transitions. [2025-03-03 15:09:38,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:38,959 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 528 transitions. [2025-03-03 15:09:38,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 15:09:38,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:38,963 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:09:38,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:09:38,963 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:38,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:38,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1991585377, now seen corresponding path program 1 times [2025-03-03 15:09:38,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:38,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38028046] [2025-03-03 15:09:38,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:38,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:38,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 15:09:39,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 15:09:39,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:39,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:39,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:39,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:39,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38028046] [2025-03-03 15:09:39,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38028046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:39,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:39,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:09:39,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902385271] [2025-03-03 15:09:39,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:39,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:09:39,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:39,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:09:39,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:39,093 INFO L87 Difference]: Start difference. First operand 345 states and 528 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:39,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:39,121 INFO L93 Difference]: Finished difference Result 901 states and 1410 transitions. [2025-03-03 15:09:39,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:09:39,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-03-03 15:09:39,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:39,126 INFO L225 Difference]: With dead ends: 901 [2025-03-03 15:09:39,126 INFO L226 Difference]: Without dead ends: 591 [2025-03-03 15:09:39,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:39,128 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 125 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:39,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 393 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:09:39,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2025-03-03 15:09:39,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 589. [2025-03-03 15:09:39,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 588 states have (on average 1.5510204081632653) internal successors, (912), 588 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:39,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 912 transitions. [2025-03-03 15:09:39,143 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 912 transitions. Word has length 62 [2025-03-03 15:09:39,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:39,143 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 912 transitions. [2025-03-03 15:09:39,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:39,143 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 912 transitions. [2025-03-03 15:09:39,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 15:09:39,144 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:39,144 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:09:39,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:09:39,144 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:39,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:39,145 INFO L85 PathProgramCache]: Analyzing trace with hash 108753026, now seen corresponding path program 1 times [2025-03-03 15:09:39,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:39,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991655682] [2025-03-03 15:09:39,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:39,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:39,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 15:09:39,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 15:09:39,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:39,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:39,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:39,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:39,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991655682] [2025-03-03 15:09:39,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991655682] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:39,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:39,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:09:39,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712452823] [2025-03-03 15:09:39,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:39,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:09:39,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:39,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:09:39,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:39,246 INFO L87 Difference]: Start difference. First operand 589 states and 912 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:39,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:39,269 INFO L93 Difference]: Finished difference Result 1569 states and 2458 transitions. [2025-03-03 15:09:39,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:09:39,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-03 15:09:39,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:39,273 INFO L225 Difference]: With dead ends: 1569 [2025-03-03 15:09:39,273 INFO L226 Difference]: Without dead ends: 1015 [2025-03-03 15:09:39,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:39,277 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 120 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:39,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 378 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:09:39,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2025-03-03 15:09:39,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 1013. [2025-03-03 15:09:39,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1013 states, 1012 states have (on average 1.5533596837944663) internal successors, (1572), 1012 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:39,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1572 transitions. [2025-03-03 15:09:39,298 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1572 transitions. Word has length 63 [2025-03-03 15:09:39,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:39,298 INFO L471 AbstractCegarLoop]: Abstraction has 1013 states and 1572 transitions. [2025-03-03 15:09:39,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:39,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1572 transitions. [2025-03-03 15:09:39,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 15:09:39,299 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:39,299 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:09:39,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:09:39,301 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:39,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:39,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1481060313, now seen corresponding path program 1 times [2025-03-03 15:09:39,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:39,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999154096] [2025-03-03 15:09:39,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:39,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:39,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 15:09:39,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 15:09:39,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:39,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:39,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:39,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:39,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999154096] [2025-03-03 15:09:39,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999154096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:39,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:39,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:09:39,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939524016] [2025-03-03 15:09:39,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:39,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:09:39,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:39,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:09:39,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:09:39,494 INFO L87 Difference]: Start difference. First operand 1013 states and 1572 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:39,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:39,660 INFO L93 Difference]: Finished difference Result 6881 states and 10794 transitions. [2025-03-03 15:09:39,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:09:39,660 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-03 15:09:39,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:39,680 INFO L225 Difference]: With dead ends: 6881 [2025-03-03 15:09:39,681 INFO L226 Difference]: Without dead ends: 5903 [2025-03-03 15:09:39,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:09:39,687 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 1406 mSDsluCounter, 2029 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1406 SdHoareTripleChecker+Valid, 2213 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:39,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1406 Valid, 2213 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:09:39,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5903 states. [2025-03-03 15:09:39,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5903 to 1989. [2025-03-03 15:09:39,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1989 states, 1988 states have (on average 1.5472837022132797) internal successors, (3076), 1988 states have internal predecessors, (3076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:39,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1989 states and 3076 transitions. [2025-03-03 15:09:39,778 INFO L78 Accepts]: Start accepts. Automaton has 1989 states and 3076 transitions. Word has length 64 [2025-03-03 15:09:39,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:39,778 INFO L471 AbstractCegarLoop]: Abstraction has 1989 states and 3076 transitions. [2025-03-03 15:09:39,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:39,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1989 states and 3076 transitions. [2025-03-03 15:09:39,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 15:09:39,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:39,782 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:09:39,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:09:39,782 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:39,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:39,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1330815246, now seen corresponding path program 1 times [2025-03-03 15:09:39,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:39,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142258365] [2025-03-03 15:09:39,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:39,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:39,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 15:09:39,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 15:09:39,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:39,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:40,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:40,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:40,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142258365] [2025-03-03 15:09:40,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142258365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:40,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:40,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:09:40,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510093875] [2025-03-03 15:09:40,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:40,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:09:40,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:40,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:09:40,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:09:40,016 INFO L87 Difference]: Start difference. First operand 1989 states and 3076 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:40,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:40,145 INFO L93 Difference]: Finished difference Result 10479 states and 16169 transitions. [2025-03-03 15:09:40,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:09:40,146 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-03 15:09:40,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:40,172 INFO L225 Difference]: With dead ends: 10479 [2025-03-03 15:09:40,173 INFO L226 Difference]: Without dead ends: 8525 [2025-03-03 15:09:40,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:09:40,180 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 903 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 903 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:40,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [903 Valid, 889 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:09:40,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8525 states. [2025-03-03 15:09:40,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8525 to 8517. [2025-03-03 15:09:40,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8517 states, 8516 states have (on average 1.5373414748708314) internal successors, (13092), 8516 states have internal predecessors, (13092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:40,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8517 states to 8517 states and 13092 transitions. [2025-03-03 15:09:40,363 INFO L78 Accepts]: Start accepts. Automaton has 8517 states and 13092 transitions. Word has length 65 [2025-03-03 15:09:40,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:40,364 INFO L471 AbstractCegarLoop]: Abstraction has 8517 states and 13092 transitions. [2025-03-03 15:09:40,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:40,364 INFO L276 IsEmpty]: Start isEmpty. Operand 8517 states and 13092 transitions. [2025-03-03 15:09:40,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 15:09:40,367 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:40,367 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:09:40,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:09:40,367 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:40,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:40,368 INFO L85 PathProgramCache]: Analyzing trace with hash 491555791, now seen corresponding path program 1 times [2025-03-03 15:09:40,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:40,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904757623] [2025-03-03 15:09:40,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:40,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:40,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 15:09:40,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 15:09:40,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:40,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:40,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:40,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:40,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904757623] [2025-03-03 15:09:40,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904757623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:40,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:40,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:09:40,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637378312] [2025-03-03 15:09:40,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:40,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:09:40,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:40,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:09:40,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:40,444 INFO L87 Difference]: Start difference. First operand 8517 states and 13092 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:40,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:40,553 INFO L93 Difference]: Finished difference Result 23401 states and 35846 transitions. [2025-03-03 15:09:40,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:09:40,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-03 15:09:40,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:40,602 INFO L225 Difference]: With dead ends: 23401 [2025-03-03 15:09:40,603 INFO L226 Difference]: Without dead ends: 14919 [2025-03-03 15:09:40,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:40,618 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 136 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:40,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 456 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:09:40,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14919 states. [2025-03-03 15:09:40,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14919 to 14917. [2025-03-03 15:09:40,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14917 states, 14916 states have (on average 1.5170286940198445) internal successors, (22628), 14916 states have internal predecessors, (22628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:40,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14917 states to 14917 states and 22628 transitions. [2025-03-03 15:09:40,937 INFO L78 Accepts]: Start accepts. Automaton has 14917 states and 22628 transitions. Word has length 67 [2025-03-03 15:09:40,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:40,937 INFO L471 AbstractCegarLoop]: Abstraction has 14917 states and 22628 transitions. [2025-03-03 15:09:40,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:40,938 INFO L276 IsEmpty]: Start isEmpty. Operand 14917 states and 22628 transitions. [2025-03-03 15:09:40,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 15:09:40,938 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:40,939 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:09:40,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:09:40,939 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:40,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:40,940 INFO L85 PathProgramCache]: Analyzing trace with hash 990324244, now seen corresponding path program 1 times [2025-03-03 15:09:40,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:40,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561554379] [2025-03-03 15:09:40,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:40,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:40,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 15:09:40,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 15:09:40,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:40,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:41,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:41,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:41,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561554379] [2025-03-03 15:09:41,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561554379] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:41,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:41,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:09:41,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072761836] [2025-03-03 15:09:41,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:41,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:09:41,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:41,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:09:41,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:09:41,229 INFO L87 Difference]: Start difference. First operand 14917 states and 22628 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:41,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:41,285 INFO L93 Difference]: Finished difference Result 15559 states and 23589 transitions. [2025-03-03 15:09:41,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:09:41,285 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-03 15:09:41,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:41,313 INFO L225 Difference]: With dead ends: 15559 [2025-03-03 15:09:41,314 INFO L226 Difference]: Without dead ends: 15557 [2025-03-03 15:09:41,321 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-03 15:09:41,321 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 0 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:41,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 722 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:09:41,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15557 states. [2025-03-03 15:09:41,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15557 to 15557. [2025-03-03 15:09:41,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15557 states, 15556 states have (on average 1.4957572640781691) internal successors, (23268), 15556 states have internal predecessors, (23268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:41,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15557 states to 15557 states and 23268 transitions. [2025-03-03 15:09:41,547 INFO L78 Accepts]: Start accepts. Automaton has 15557 states and 23268 transitions. Word has length 67 [2025-03-03 15:09:41,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:41,547 INFO L471 AbstractCegarLoop]: Abstraction has 15557 states and 23268 transitions. [2025-03-03 15:09:41,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:41,547 INFO L276 IsEmpty]: Start isEmpty. Operand 15557 states and 23268 transitions. [2025-03-03 15:09:41,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 15:09:41,548 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:41,548 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:09:41,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:09:41,548 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:41,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:41,548 INFO L85 PathProgramCache]: Analyzing trace with hash 640049047, now seen corresponding path program 1 times [2025-03-03 15:09:41,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:41,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307551142] [2025-03-03 15:09:41,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:41,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:41,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 15:09:41,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 15:09:41,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:41,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:41,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:41,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:41,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307551142] [2025-03-03 15:09:41,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307551142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:41,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:41,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:09:41,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133996455] [2025-03-03 15:09:41,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:41,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:09:41,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:41,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:09:41,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:41,646 INFO L87 Difference]: Start difference. First operand 15557 states and 23268 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:41,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:41,709 INFO L93 Difference]: Finished difference Result 38043 states and 56888 transitions. [2025-03-03 15:09:41,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:09:41,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-03 15:09:41,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:41,747 INFO L225 Difference]: With dead ends: 38043 [2025-03-03 15:09:41,747 INFO L226 Difference]: Without dead ends: 22521 [2025-03-03 15:09:41,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:41,767 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 109 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:41,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 329 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:09:41,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22521 states. [2025-03-03 15:09:42,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22521 to 22375. [2025-03-03 15:09:42,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22375 states, 22374 states have (on average 1.4848484848484849) internal successors, (33222), 22374 states have internal predecessors, (33222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:42,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22375 states to 22375 states and 33222 transitions. [2025-03-03 15:09:42,147 INFO L78 Accepts]: Start accepts. Automaton has 22375 states and 33222 transitions. Word has length 68 [2025-03-03 15:09:42,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:42,147 INFO L471 AbstractCegarLoop]: Abstraction has 22375 states and 33222 transitions. [2025-03-03 15:09:42,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:42,148 INFO L276 IsEmpty]: Start isEmpty. Operand 22375 states and 33222 transitions. [2025-03-03 15:09:42,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 15:09:42,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:42,156 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 15:09:42,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:09:42,156 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:42,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:42,157 INFO L85 PathProgramCache]: Analyzing trace with hash 479233498, now seen corresponding path program 1 times [2025-03-03 15:09:42,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:42,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766549853] [2025-03-03 15:09:42,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:42,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:42,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 15:09:42,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 15:09:42,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:42,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:42,232 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:42,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:42,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766549853] [2025-03-03 15:09:42,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766549853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:42,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:42,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:09:42,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072910102] [2025-03-03 15:09:42,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:42,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:09:42,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:42,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:09:42,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:42,234 INFO L87 Difference]: Start difference. First operand 22375 states and 33222 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:42,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:42,377 INFO L93 Difference]: Finished difference Result 56004 states and 83033 transitions. [2025-03-03 15:09:42,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:09:42,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-03 15:09:42,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:42,445 INFO L225 Difference]: With dead ends: 56004 [2025-03-03 15:09:42,445 INFO L226 Difference]: Without dead ends: 37186 [2025-03-03 15:09:42,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:42,472 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 107 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:42,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 369 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:09:42,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37186 states. [2025-03-03 15:09:43,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37186 to 35784. [2025-03-03 15:09:43,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35784 states, 35783 states have (on average 1.4708381074812062) internal successors, (52631), 35783 states have internal predecessors, (52631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:43,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35784 states to 35784 states and 52631 transitions. [2025-03-03 15:09:43,099 INFO L78 Accepts]: Start accepts. Automaton has 35784 states and 52631 transitions. Word has length 94 [2025-03-03 15:09:43,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:43,099 INFO L471 AbstractCegarLoop]: Abstraction has 35784 states and 52631 transitions. [2025-03-03 15:09:43,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:43,099 INFO L276 IsEmpty]: Start isEmpty. Operand 35784 states and 52631 transitions. [2025-03-03 15:09:43,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 15:09:43,111 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:43,111 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 15:09:43,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:09:43,111 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:43,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:43,112 INFO L85 PathProgramCache]: Analyzing trace with hash -261973260, now seen corresponding path program 1 times [2025-03-03 15:09:43,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:43,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501821459] [2025-03-03 15:09:43,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:43,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:43,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 15:09:43,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 15:09:43,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:43,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:43,170 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:43,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:43,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501821459] [2025-03-03 15:09:43,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501821459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:43,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:43,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:09:43,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074426536] [2025-03-03 15:09:43,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:43,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:09:43,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:43,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:09:43,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:43,172 INFO L87 Difference]: Start difference. First operand 35784 states and 52631 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:43,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:43,311 INFO L93 Difference]: Finished difference Result 83141 states and 121966 transitions. [2025-03-03 15:09:43,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:09:43,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-03 15:09:43,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:43,385 INFO L225 Difference]: With dead ends: 83141 [2025-03-03 15:09:43,385 INFO L226 Difference]: Without dead ends: 55635 [2025-03-03 15:09:43,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:43,519 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 108 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:43,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 388 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:09:43,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55635 states. [2025-03-03 15:09:44,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55635 to 53953. [2025-03-03 15:09:44,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53953 states, 53952 states have (on average 1.4544039145907472) internal successors, (78468), 53952 states have internal predecessors, (78468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:44,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53953 states to 53953 states and 78468 transitions. [2025-03-03 15:09:44,310 INFO L78 Accepts]: Start accepts. Automaton has 53953 states and 78468 transitions. Word has length 94 [2025-03-03 15:09:44,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:44,310 INFO L471 AbstractCegarLoop]: Abstraction has 53953 states and 78468 transitions. [2025-03-03 15:09:44,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:44,310 INFO L276 IsEmpty]: Start isEmpty. Operand 53953 states and 78468 transitions. [2025-03-03 15:09:44,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 15:09:44,326 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:44,326 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 15:09:44,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:09:44,327 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:44,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:44,327 INFO L85 PathProgramCache]: Analyzing trace with hash -596685554, now seen corresponding path program 1 times [2025-03-03 15:09:44,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:44,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133475799] [2025-03-03 15:09:44,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:44,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:44,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 15:09:44,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 15:09:44,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:44,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:44,486 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:44,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:44,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133475799] [2025-03-03 15:09:44,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133475799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:44,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:44,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:09:44,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078208945] [2025-03-03 15:09:44,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:44,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:09:44,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:44,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:09:44,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:44,487 INFO L87 Difference]: Start difference. First operand 53953 states and 78468 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:44,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:44,679 INFO L93 Difference]: Finished difference Result 111552 states and 161675 transitions. [2025-03-03 15:09:44,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:09:44,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-03 15:09:44,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:44,868 INFO L225 Difference]: With dead ends: 111552 [2025-03-03 15:09:44,868 INFO L226 Difference]: Without dead ends: 75838 [2025-03-03 15:09:44,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:44,901 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 109 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:44,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 417 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:09:44,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75838 states. [2025-03-03 15:09:45,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75838 to 72452. [2025-03-03 15:09:45,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72452 states, 72451 states have (on average 1.4370678113483595) internal successors, (104117), 72451 states have internal predecessors, (104117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:45,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72452 states to 72452 states and 104117 transitions. [2025-03-03 15:09:45,867 INFO L78 Accepts]: Start accepts. Automaton has 72452 states and 104117 transitions. Word has length 94 [2025-03-03 15:09:45,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:45,867 INFO L471 AbstractCegarLoop]: Abstraction has 72452 states and 104117 transitions. [2025-03-03 15:09:45,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:45,868 INFO L276 IsEmpty]: Start isEmpty. Operand 72452 states and 104117 transitions. [2025-03-03 15:09:45,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 15:09:45,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:45,884 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 15:09:45,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:09:45,884 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:45,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:45,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1198711768, now seen corresponding path program 1 times [2025-03-03 15:09:45,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:45,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688983955] [2025-03-03 15:09:45,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:45,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:45,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 15:09:45,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 15:09:45,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:45,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:46,046 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 15:09:46,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:46,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688983955] [2025-03-03 15:09:46,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688983955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:46,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:46,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:09:46,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924137048] [2025-03-03 15:09:46,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:46,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:09:46,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:46,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:09:46,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:09:46,049 INFO L87 Difference]: Start difference. First operand 72452 states and 104117 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:46,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:46,578 INFO L93 Difference]: Finished difference Result 187412 states and 271787 transitions. [2025-03-03 15:09:46,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:09:46,580 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-03 15:09:46,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:46,767 INFO L225 Difference]: With dead ends: 187412 [2025-03-03 15:09:46,767 INFO L226 Difference]: Without dead ends: 169906 [2025-03-03 15:09:46,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:09:46,813 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 1497 mSDsluCounter, 1030 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1497 SdHoareTripleChecker+Valid, 1352 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:46,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1497 Valid, 1352 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:09:46,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169906 states. [2025-03-03 15:09:48,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169906 to 89700. [2025-03-03 15:09:48,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89700 states, 89699 states have (on average 1.4347205654466606) internal successors, (128693), 89699 states have internal predecessors, (128693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:48,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89700 states to 89700 states and 128693 transitions. [2025-03-03 15:09:48,431 INFO L78 Accepts]: Start accepts. Automaton has 89700 states and 128693 transitions. Word has length 94 [2025-03-03 15:09:48,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:48,431 INFO L471 AbstractCegarLoop]: Abstraction has 89700 states and 128693 transitions. [2025-03-03 15:09:48,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:48,431 INFO L276 IsEmpty]: Start isEmpty. Operand 89700 states and 128693 transitions. [2025-03-03 15:09:48,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 15:09:48,446 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:48,446 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 15:09:48,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:09:48,446 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:48,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:48,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1684014574, now seen corresponding path program 1 times [2025-03-03 15:09:48,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:48,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849238041] [2025-03-03 15:09:48,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:48,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:48,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 15:09:48,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 15:09:48,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:48,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:48,573 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 15:09:48,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:48,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849238041] [2025-03-03 15:09:48,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849238041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:48,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:48,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:09:48,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399516634] [2025-03-03 15:09:48,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:48,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:09:48,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:48,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:09:48,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:09:48,574 INFO L87 Difference]: Start difference. First operand 89700 states and 128693 transitions. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:49,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:49,354 INFO L93 Difference]: Finished difference Result 213236 states and 309035 transitions. [2025-03-03 15:09:49,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:09:49,355 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-03 15:09:49,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:49,587 INFO L225 Difference]: With dead ends: 213236 [2025-03-03 15:09:49,587 INFO L226 Difference]: Without dead ends: 187026 [2025-03-03 15:09:49,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:09:49,634 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 1331 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1331 SdHoareTripleChecker+Valid, 1456 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:49,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1331 Valid, 1456 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:09:49,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187026 states. [2025-03-03 15:09:51,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187026 to 115524. [2025-03-03 15:09:51,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115524 states, 115523 states have (on average 1.434770565168841) internal successors, (165749), 115523 states have internal predecessors, (165749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:51,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115524 states to 115524 states and 165749 transitions. [2025-03-03 15:09:51,410 INFO L78 Accepts]: Start accepts. Automaton has 115524 states and 165749 transitions. Word has length 94 [2025-03-03 15:09:51,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:51,410 INFO L471 AbstractCegarLoop]: Abstraction has 115524 states and 165749 transitions. [2025-03-03 15:09:51,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:51,411 INFO L276 IsEmpty]: Start isEmpty. Operand 115524 states and 165749 transitions. [2025-03-03 15:09:51,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 15:09:51,429 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:51,430 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 15:09:51,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:09:51,430 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:51,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:51,430 INFO L85 PathProgramCache]: Analyzing trace with hash 731520372, now seen corresponding path program 1 times [2025-03-03 15:09:51,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:51,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747660770] [2025-03-03 15:09:51,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:51,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:51,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 15:09:51,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 15:09:51,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:51,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:51,833 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 15:09:51,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:51,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747660770] [2025-03-03 15:09:51,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747660770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:51,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:51,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:09:51,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616032389] [2025-03-03 15:09:51,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:51,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:09:51,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:51,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:09:51,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:09:51,834 INFO L87 Difference]: Start difference. First operand 115524 states and 165749 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:52,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:52,405 INFO L93 Difference]: Finished difference Result 243972 states and 353315 transitions. [2025-03-03 15:09:52,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:09:52,409 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-03 15:09:52,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:52,705 INFO L225 Difference]: With dead ends: 243972 [2025-03-03 15:09:52,705 INFO L226 Difference]: Without dead ends: 212786 [2025-03-03 15:09:52,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:09:52,783 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 1346 mSDsluCounter, 1165 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1346 SdHoareTripleChecker+Valid, 1497 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:52,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1346 Valid, 1497 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:09:52,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212786 states. [2025-03-03 15:09:54,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212786 to 141996. [2025-03-03 15:09:54,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141996 states, 141995 states have (on average 1.4365364977640058) internal successors, (203981), 141995 states have internal predecessors, (203981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:55,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141996 states to 141996 states and 203981 transitions. [2025-03-03 15:09:55,011 INFO L78 Accepts]: Start accepts. Automaton has 141996 states and 203981 transitions. Word has length 94 [2025-03-03 15:09:55,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:55,011 INFO L471 AbstractCegarLoop]: Abstraction has 141996 states and 203981 transitions. [2025-03-03 15:09:55,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:55,011 INFO L276 IsEmpty]: Start isEmpty. Operand 141996 states and 203981 transitions. [2025-03-03 15:09:55,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 15:09:55,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:55,031 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 15:09:55,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 15:09:55,031 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:55,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:55,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1151909794, now seen corresponding path program 1 times [2025-03-03 15:09:55,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:55,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924736406] [2025-03-03 15:09:55,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:55,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:55,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 15:09:55,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 15:09:55,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:55,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:55,191 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 15:09:55,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:55,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924736406] [2025-03-03 15:09:55,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924736406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:55,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:55,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:09:55,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117355685] [2025-03-03 15:09:55,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:55,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:09:55,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:55,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:09:55,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:09:55,192 INFO L87 Difference]: Start difference. First operand 141996 states and 203981 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:56,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:56,404 INFO L93 Difference]: Finished difference Result 277568 states and 401615 transitions. [2025-03-03 15:09:56,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:09:56,405 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-03 15:09:56,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:56,742 INFO L225 Difference]: With dead ends: 277568 [2025-03-03 15:09:56,742 INFO L226 Difference]: Without dead ends: 243482 [2025-03-03 15:09:56,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:09:56,784 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 1477 mSDsluCounter, 1090 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1477 SdHoareTripleChecker+Valid, 1421 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:56,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1477 Valid, 1421 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:09:56,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243482 states. [2025-03-03 15:09:58,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243482 to 165780. [2025-03-03 15:09:58,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165780 states, 165779 states have (on average 1.4379203638579072) internal successors, (238377), 165779 states have internal predecessors, (238377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:58,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165780 states to 165780 states and 238377 transitions. [2025-03-03 15:09:58,976 INFO L78 Accepts]: Start accepts. Automaton has 165780 states and 238377 transitions. Word has length 94 [2025-03-03 15:09:58,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:58,976 INFO L471 AbstractCegarLoop]: Abstraction has 165780 states and 238377 transitions. [2025-03-03 15:09:58,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:58,976 INFO L276 IsEmpty]: Start isEmpty. Operand 165780 states and 238377 transitions. [2025-03-03 15:09:58,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 15:09:58,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:58,992 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:09:58,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 15:09:58,992 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:58,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:58,992 INFO L85 PathProgramCache]: Analyzing trace with hash 2015591785, now seen corresponding path program 1 times [2025-03-03 15:09:58,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:58,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004737234] [2025-03-03 15:09:58,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:58,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:59,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 15:09:59,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 15:09:59,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:59,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:59,601 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:59,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:59,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004737234] [2025-03-03 15:09:59,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004737234] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:09:59,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092454374] [2025-03-03 15:09:59,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:59,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:09:59,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:09:59,604 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:09:59,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 15:09:59,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 15:09:59,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 15:09:59,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:59,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:59,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 15:09:59,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:10:00,491 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:10:00,491 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:10:01,074 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:10:01,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092454374] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:10:01,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:10:01,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 23 [2025-03-03 15:10:01,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648406389] [2025-03-03 15:10:01,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:10:01,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 15:10:01,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:01,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 15:10:01,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2025-03-03 15:10:01,077 INFO L87 Difference]: Start difference. First operand 165780 states and 238377 transitions. Second operand has 23 states, 23 states have (on average 12.0) internal successors, (276), 23 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:10:10,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:10:10,891 INFO L93 Difference]: Finished difference Result 1253471 states and 1792553 transitions. [2025-03-03 15:10:10,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2025-03-03 15:10:10,892 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 12.0) internal successors, (276), 23 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-03-03 15:10:10,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:12,618 INFO L225 Difference]: With dead ends: 1253471 [2025-03-03 15:10:12,618 INFO L226 Difference]: Without dead ends: 1087801 [2025-03-03 15:10:12,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8085 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=3569, Invalid=17023, Unknown=0, NotChecked=0, Total=20592 [2025-03-03 15:10:12,835 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 9598 mSDsluCounter, 2975 mSDsCounter, 0 mSdLazyCounter, 3200 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9598 SdHoareTripleChecker+Valid, 3199 SdHoareTripleChecker+Invalid, 3364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 3200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:10:12,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9598 Valid, 3199 Invalid, 3364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 3200 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 15:10:13,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087801 states.