./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.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.3.ufo.BOUNDED-6.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 87f1dffc4791cf25ae510fd8866e3e496425d62832b1b02adb55ef79c14eda4f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:06:06,349 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:06:06,402 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:06:06,406 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:06:06,406 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:06:06,428 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:06:06,429 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:06:06,429 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:06:06,430 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:06:06,430 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:06:06,430 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:06:06,430 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:06:06,430 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:06:06,431 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:06:06,431 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:06:06,431 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:06:06,431 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:06:06,431 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:06:06,431 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:06:06,431 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:06:06,431 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:06:06,431 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:06:06,432 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:06:06,432 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:06:06,432 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:06:06,432 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:06:06,432 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:06:06,432 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:06:06,432 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:06:06,432 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:06:06,432 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:06:06,432 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:06:06,432 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:06:06,432 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:06:06,432 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:06:06,432 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:06:06,432 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:06:06,432 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:06:06,432 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:06:06,432 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:06:06,432 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:06:06,432 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:06:06,432 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:06:06,432 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 -> 87f1dffc4791cf25ae510fd8866e3e496425d62832b1b02adb55ef79c14eda4f [2025-03-03 15:06:06,657 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:06:06,664 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:06:06,666 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:06:06,668 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:06:06,668 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:06:06,669 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2025-03-03 15:06:07,804 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81754c120/a2919297c3f949b3b3776fd9aba5c090/FLAGf6def0cff [2025-03-03 15:06:08,005 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:06:08,006 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2025-03-03 15:06:08,012 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81754c120/a2919297c3f949b3b3776fd9aba5c090/FLAGf6def0cff [2025-03-03 15:06:08,022 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81754c120/a2919297c3f949b3b3776fd9aba5c090 [2025-03-03 15:06:08,024 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:06:08,025 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:06:08,026 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:06:08,026 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:06:08,029 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:06:08,029 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:06:08" (1/1) ... [2025-03-03 15:06:08,030 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b2646df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:06:08, skipping insertion in model container [2025-03-03 15:06:08,030 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:06:08" (1/1) ... [2025-03-03 15:06:08,045 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:06:08,192 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[4371,4384] [2025-03-03 15:06:08,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:06:08,231 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:06:08,260 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[4371,4384] [2025-03-03 15:06:08,271 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:06:08,286 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:06:08,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:06:08 WrapperNode [2025-03-03 15:06:08,287 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:06:08,288 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:06:08,288 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:06:08,288 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:06:08,292 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:06:08" (1/1) ... [2025-03-03 15:06:08,299 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:06:08" (1/1) ... [2025-03-03 15:06:08,323 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 366 [2025-03-03 15:06:08,324 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:06:08,327 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:06:08,327 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:06:08,327 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:06:08,333 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:06:08" (1/1) ... [2025-03-03 15:06:08,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:06:08" (1/1) ... [2025-03-03 15:06:08,336 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:06:08" (1/1) ... [2025-03-03 15:06:08,348 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:06:08,349 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:06:08" (1/1) ... [2025-03-03 15:06:08,349 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:06:08" (1/1) ... [2025-03-03 15:06:08,353 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:06:08" (1/1) ... [2025-03-03 15:06:08,354 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:06:08" (1/1) ... [2025-03-03 15:06:08,355 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:06:08" (1/1) ... [2025-03-03 15:06:08,355 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:06:08" (1/1) ... [2025-03-03 15:06:08,360 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:06:08,361 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:06:08,362 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:06:08,362 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:06:08,362 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:06:08" (1/1) ... [2025-03-03 15:06:08,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:06:08,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:06:08,387 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:06:08,390 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:06:08,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:06:08,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:06:08,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:06:08,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:06:08,478 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:06:08,480 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:06:08,744 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L152: havoc main_~node2__m2~0#1; [2025-03-03 15:06:08,744 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L170: havoc main_~node3__m3~0#1; [2025-03-03 15:06:08,744 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L385: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-03-03 15:06:08,744 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L443: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-03 15:06:08,744 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L271: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-03 15:06:08,744 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L471: havoc main_~node1____CPAchecker_TMP_1~0#1; [2025-03-03 15:06:08,744 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L133: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-03 15:06:08,745 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L216: havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-03 15:06:08,745 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L299: havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-03-03 15:06:08,745 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L357: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-03 15:06:08,763 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2025-03-03 15:06:08,764 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:06:08,771 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:06:08,772 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:06:08,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:06:08 BoogieIcfgContainer [2025-03-03 15:06:08,772 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:06:08,774 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:06:08,774 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:06:08,777 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:06:08,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:06:08" (1/3) ... [2025-03-03 15:06:08,778 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e642ab4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:06:08, skipping insertion in model container [2025-03-03 15:06:08,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:06:08" (2/3) ... [2025-03-03 15:06:08,779 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e642ab4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:06:08, skipping insertion in model container [2025-03-03 15:06:08,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:06:08" (3/3) ... [2025-03-03 15:06:08,780 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2025-03-03 15:06:08,790 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:06:08,791 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c that has 1 procedures, 85 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-03 15:06:08,829 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:06:08,838 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;@3f4e2f03, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:06:08,838 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 15:06:08,841 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 83 states have (on average 1.6867469879518073) internal successors, (140), 84 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:08,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 15:06:08,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:08,846 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] [2025-03-03 15:06:08,846 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:08,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:08,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1417554623, now seen corresponding path program 1 times [2025-03-03 15:06:08,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:08,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148708991] [2025-03-03 15:06:08,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:08,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:08,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 15:06:08,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 15:06:08,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:08,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:09,134 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:06:09,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:09,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148708991] [2025-03-03 15:06:09,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148708991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:09,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:09,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:06:09,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202788762] [2025-03-03 15:06:09,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:09,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:06:09,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:09,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:06:09,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:06:09,163 INFO L87 Difference]: Start difference. First operand has 85 states, 83 states have (on average 1.6867469879518073) internal successors, (140), 84 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states 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:06:09,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:09,203 INFO L93 Difference]: Finished difference Result 199 states and 318 transitions. [2025-03-03 15:06:09,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:06:09,205 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2025-03-03 15:06:09,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:09,211 INFO L225 Difference]: With dead ends: 199 [2025-03-03 15:06:09,212 INFO L226 Difference]: Without dead ends: 128 [2025-03-03 15:06:09,214 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:06:09,215 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 101 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 300 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:06:09,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 300 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:06:09,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-03 15:06:09,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2025-03-03 15:06:09,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 1.504) internal successors, (188), 125 states have internal predecessors, (188), 0 states have call successors, (0), 0 states 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:06:09,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 188 transitions. [2025-03-03 15:06:09,243 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 188 transitions. Word has length 37 [2025-03-03 15:06:09,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:09,244 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 188 transitions. [2025-03-03 15:06:09,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states 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:06:09,244 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 188 transitions. [2025-03-03 15:06:09,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 15:06:09,244 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:09,244 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] [2025-03-03 15:06:09,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:06:09,245 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:09,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:09,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1872438142, now seen corresponding path program 1 times [2025-03-03 15:06:09,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:09,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293146762] [2025-03-03 15:06:09,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:09,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:09,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-03 15:06:09,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 15:06:09,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:09,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:09,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:09,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:09,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293146762] [2025-03-03 15:06:09,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293146762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:09,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:09,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:06:09,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033454757] [2025-03-03 15:06:09,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:09,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:06:09,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:09,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:06:09,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:06:09,378 INFO L87 Difference]: Start difference. First operand 126 states and 188 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states 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:06:09,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:09,404 INFO L93 Difference]: Finished difference Result 306 states and 472 transitions. [2025-03-03 15:06:09,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:06:09,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2025-03-03 15:06:09,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:09,406 INFO L225 Difference]: With dead ends: 306 [2025-03-03 15:06:09,406 INFO L226 Difference]: Without dead ends: 200 [2025-03-03 15:06:09,406 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:06:09,407 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 81 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 254 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:06:09,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 254 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:06:09,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-03-03 15:06:09,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 198. [2025-03-03 15:06:09,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 197 states have (on average 1.5279187817258884) internal successors, (301), 197 states have internal predecessors, (301), 0 states have call successors, (0), 0 states 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:06:09,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 301 transitions. [2025-03-03 15:06:09,417 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 301 transitions. Word has length 38 [2025-03-03 15:06:09,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:09,417 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 301 transitions. [2025-03-03 15:06:09,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states 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:06:09,417 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 301 transitions. [2025-03-03 15:06:09,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 15:06:09,420 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:09,420 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] [2025-03-03 15:06:09,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:06:09,420 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:09,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:09,420 INFO L85 PathProgramCache]: Analyzing trace with hash -492649925, now seen corresponding path program 1 times [2025-03-03 15:06:09,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:09,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763735883] [2025-03-03 15:06:09,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:09,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:09,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 15:06:09,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 15:06:09,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:09,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:09,506 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:06:09,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:09,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763735883] [2025-03-03 15:06:09,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763735883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:09,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:09,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:06:09,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409204741] [2025-03-03 15:06:09,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:09,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:06:09,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:09,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:06:09,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:06:09,509 INFO L87 Difference]: Start difference. First operand 198 states and 301 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states 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:06:09,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:09,530 INFO L93 Difference]: Finished difference Result 490 states and 759 transitions. [2025-03-03 15:06:09,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:06:09,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2025-03-03 15:06:09,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:09,531 INFO L225 Difference]: With dead ends: 490 [2025-03-03 15:06:09,531 INFO L226 Difference]: Without dead ends: 312 [2025-03-03 15:06:09,532 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:06:09,532 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 76 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 239 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:06:09,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 239 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:06:09,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-03-03 15:06:09,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 310. [2025-03-03 15:06:09,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 309 states have (on average 1.5307443365695792) internal successors, (473), 309 states have internal predecessors, (473), 0 states have call successors, (0), 0 states 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:06:09,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 473 transitions. [2025-03-03 15:06:09,553 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 473 transitions. Word has length 39 [2025-03-03 15:06:09,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:09,553 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 473 transitions. [2025-03-03 15:06:09,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states 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:06:09,553 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 473 transitions. [2025-03-03 15:06:09,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-03 15:06:09,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:09,554 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] [2025-03-03 15:06:09,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:06:09,554 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:09,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:09,554 INFO L85 PathProgramCache]: Analyzing trace with hash 17438076, now seen corresponding path program 1 times [2025-03-03 15:06:09,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:09,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048145594] [2025-03-03 15:06:09,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:09,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:09,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-03 15:06:09,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 15:06:09,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:09,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:09,648 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:06:09,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:09,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048145594] [2025-03-03 15:06:09,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048145594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:09,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:09,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:06:09,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623444234] [2025-03-03 15:06:09,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:09,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:06:09,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:09,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:06:09,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:06:09,649 INFO L87 Difference]: Start difference. First operand 310 states and 473 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states 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:06:09,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:09,730 INFO L93 Difference]: Finished difference Result 1470 states and 2285 transitions. [2025-03-03 15:06:09,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:06:09,730 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2025-03-03 15:06:09,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:09,734 INFO L225 Difference]: With dead ends: 1470 [2025-03-03 15:06:09,734 INFO L226 Difference]: Without dead ends: 1180 [2025-03-03 15:06:09,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:06:09,735 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 486 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:09,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 660 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:06:09,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2025-03-03 15:06:09,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 598. [2025-03-03 15:06:09,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 597 states have (on average 1.5226130653266332) internal successors, (909), 597 states have internal predecessors, (909), 0 states have call successors, (0), 0 states 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:06:09,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 909 transitions. [2025-03-03 15:06:09,769 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 909 transitions. Word has length 40 [2025-03-03 15:06:09,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:09,770 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 909 transitions. [2025-03-03 15:06:09,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states 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:06:09,770 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 909 transitions. [2025-03-03 15:06:09,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-03 15:06:09,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:09,771 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] [2025-03-03 15:06:09,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:06:09,771 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:09,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:09,771 INFO L85 PathProgramCache]: Analyzing trace with hash 541535723, now seen corresponding path program 1 times [2025-03-03 15:06:09,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:09,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889480201] [2025-03-03 15:06:09,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:09,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:09,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-03 15:06:09,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-03 15:06:09,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:09,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:09,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:09,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:09,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889480201] [2025-03-03 15:06:09,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889480201] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:09,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:09,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:06:09,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828296663] [2025-03-03 15:06:09,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:09,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:06:09,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:09,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:06:09,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:06:09,900 INFO L87 Difference]: Start difference. First operand 598 states and 909 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states 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:06:09,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:09,950 INFO L93 Difference]: Finished difference Result 2068 states and 3144 transitions. [2025-03-03 15:06:09,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:06:09,951 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2025-03-03 15:06:09,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:09,957 INFO L225 Difference]: With dead ends: 2068 [2025-03-03 15:06:09,957 INFO L226 Difference]: Without dead ends: 1490 [2025-03-03 15:06:09,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:06:09,958 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 408 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:09,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 286 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:06:09,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2025-03-03 15:06:09,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 1486. [2025-03-03 15:06:09,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1486 states, 1485 states have (on average 1.5063973063973064) internal successors, (2237), 1485 states have internal predecessors, (2237), 0 states have call successors, (0), 0 states 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:06:10,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1486 states and 2237 transitions. [2025-03-03 15:06:10,000 INFO L78 Accepts]: Start accepts. Automaton has 1486 states and 2237 transitions. Word has length 41 [2025-03-03 15:06:10,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:10,000 INFO L471 AbstractCegarLoop]: Abstraction has 1486 states and 2237 transitions. [2025-03-03 15:06:10,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states 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:06:10,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 2237 transitions. [2025-03-03 15:06:10,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-03 15:06:10,001 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:10,001 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] [2025-03-03 15:06:10,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:06:10,002 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:10,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:10,002 INFO L85 PathProgramCache]: Analyzing trace with hash 728310349, now seen corresponding path program 1 times [2025-03-03 15:06:10,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:10,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110211159] [2025-03-03 15:06:10,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:10,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:10,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-03 15:06:10,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 15:06:10,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:10,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:10,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:10,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:10,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110211159] [2025-03-03 15:06:10,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110211159] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:10,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:10,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:06:10,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924394248] [2025-03-03 15:06:10,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:10,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:06:10,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:10,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:06:10,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:06:10,199 INFO L87 Difference]: Start difference. First operand 1486 states and 2237 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states 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:06:10,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:10,226 INFO L93 Difference]: Finished difference Result 1584 states and 2382 transitions. [2025-03-03 15:06:10,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:06:10,226 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2025-03-03 15:06:10,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:10,230 INFO L225 Difference]: With dead ends: 1584 [2025-03-03 15:06:10,231 INFO L226 Difference]: Without dead ends: 1582 [2025-03-03 15:06:10,231 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:06:10,232 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:10,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 449 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:06:10,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2025-03-03 15:06:10,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1582. [2025-03-03 15:06:10,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1582 states, 1581 states have (on average 1.4756483238456672) internal successors, (2333), 1581 states have internal predecessors, (2333), 0 states have call successors, (0), 0 states 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:06:10,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 2333 transitions. [2025-03-03 15:06:10,271 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 2333 transitions. Word has length 43 [2025-03-03 15:06:10,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:10,272 INFO L471 AbstractCegarLoop]: Abstraction has 1582 states and 2333 transitions. [2025-03-03 15:06:10,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states 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:06:10,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 2333 transitions. [2025-03-03 15:06:10,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 15:06:10,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:10,275 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] [2025-03-03 15:06:10,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:06:10,275 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:10,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:10,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1107552954, now seen corresponding path program 1 times [2025-03-03 15:06:10,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:10,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024945763] [2025-03-03 15:06:10,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:10,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:10,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 15:06:10,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 15:06:10,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:10,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:10,338 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:06:10,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:10,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024945763] [2025-03-03 15:06:10,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024945763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:10,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:10,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:06:10,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733163330] [2025-03-03 15:06:10,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:10,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:06:10,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:10,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:06:10,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:06:10,341 INFO L87 Difference]: Start difference. First operand 1582 states and 2333 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states 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:06:10,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:10,361 INFO L93 Difference]: Finished difference Result 3816 states and 5637 transitions. [2025-03-03 15:06:10,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:06:10,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2025-03-03 15:06:10,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:10,368 INFO L225 Difference]: With dead ends: 3816 [2025-03-03 15:06:10,368 INFO L226 Difference]: Without dead ends: 2254 [2025-03-03 15:06:10,372 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:06:10,373 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 66 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:10,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 234 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:06:10,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2254 states. [2025-03-03 15:06:10,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2254 to 2252. [2025-03-03 15:06:10,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2252 states, 2251 states have (on average 1.4673478454020434) internal successors, (3303), 2251 states have internal predecessors, (3303), 0 states have call successors, (0), 0 states 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:06:10,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2252 states to 2252 states and 3303 transitions. [2025-03-03 15:06:10,407 INFO L78 Accepts]: Start accepts. Automaton has 2252 states and 3303 transitions. Word has length 44 [2025-03-03 15:06:10,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:10,408 INFO L471 AbstractCegarLoop]: Abstraction has 2252 states and 3303 transitions. [2025-03-03 15:06:10,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states 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:06:10,408 INFO L276 IsEmpty]: Start isEmpty. Operand 2252 states and 3303 transitions. [2025-03-03 15:06:10,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 15:06:10,410 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:10,410 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:06:10,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:06:10,410 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:10,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:10,411 INFO L85 PathProgramCache]: Analyzing trace with hash 235630635, now seen corresponding path program 1 times [2025-03-03 15:06:10,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:10,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619321688] [2025-03-03 15:06:10,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:10,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:10,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 15:06:10,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 15:06:10,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:10,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:10,680 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:10,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:10,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619321688] [2025-03-03 15:06:10,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619321688] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:06:10,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047887956] [2025-03-03 15:06:10,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:10,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:06:10,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:06:10,689 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:06:10,691 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:06:10,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 15:06:10,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 15:06:10,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:10,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:10,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 15:06:10,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:06:11,308 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:11,308 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:06:11,797 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:11,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047887956] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:06:11,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:06:11,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 21 [2025-03-03 15:06:11,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691086534] [2025-03-03 15:06:11,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:06:11,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 15:06:11,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:11,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 15:06:11,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2025-03-03 15:06:11,799 INFO L87 Difference]: Start difference. First operand 2252 states and 3303 transitions. Second operand has 21 states, 21 states have (on average 8.285714285714286) internal successors, (174), 21 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:06:15,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:15,945 INFO L93 Difference]: Finished difference Result 13852 states and 20187 transitions. [2025-03-03 15:06:15,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2025-03-03 15:06:15,945 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 8.285714285714286) internal successors, (174), 21 states have internal predecessors, (174), 0 states have call successors, (0), 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:06:15,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:15,976 INFO L225 Difference]: With dead ends: 13852 [2025-03-03 15:06:15,976 INFO L226 Difference]: Without dead ends: 11622 [2025-03-03 15:06:15,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4833 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2516, Invalid=10366, Unknown=0, NotChecked=0, Total=12882 [2025-03-03 15:06:15,984 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 7011 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 1405 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7011 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 1589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 1405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:15,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7011 Valid, 1144 Invalid, 1589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 1405 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 15:06:15,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11622 states. [2025-03-03 15:06:16,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11622 to 10492. [2025-03-03 15:06:16,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10492 states, 10491 states have (on average 1.4418072633686017) internal successors, (15126), 10491 states have internal predecessors, (15126), 0 states have call successors, (0), 0 states 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:06:16,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10492 states to 10492 states and 15126 transitions. [2025-03-03 15:06:16,144 INFO L78 Accepts]: Start accepts. Automaton has 10492 states and 15126 transitions. Word has length 61 [2025-03-03 15:06:16,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:16,144 INFO L471 AbstractCegarLoop]: Abstraction has 10492 states and 15126 transitions. [2025-03-03 15:06:16,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 8.285714285714286) internal successors, (174), 21 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:06:16,144 INFO L276 IsEmpty]: Start isEmpty. Operand 10492 states and 15126 transitions. [2025-03-03 15:06:16,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 15:06:16,145 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:16,145 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:06:16,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 15:06:16,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:06:16,350 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:16,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:16,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1283027785, now seen corresponding path program 1 times [2025-03-03 15:06:16,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:16,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326931813] [2025-03-03 15:06:16,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:16,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:16,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 15:06:16,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 15:06:16,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:16,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:16,409 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:16,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:16,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326931813] [2025-03-03 15:06:16,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326931813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:16,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:16,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:06:16,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420725090] [2025-03-03 15:06:16,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:16,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:06:16,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:16,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:06:16,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:06:16,412 INFO L87 Difference]: Start difference. First operand 10492 states and 15126 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:06:16,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:16,457 INFO L93 Difference]: Finished difference Result 24257 states and 34835 transitions. [2025-03-03 15:06:16,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:06:16,457 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:06:16,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:16,534 INFO L225 Difference]: With dead ends: 24257 [2025-03-03 15:06:16,534 INFO L226 Difference]: Without dead ends: 16633 [2025-03-03 15:06:16,539 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:06:16,540 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 63 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 222 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:06:16,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 222 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:06:16,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16633 states. [2025-03-03 15:06:16,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16633 to 16631. [2025-03-03 15:06:16,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16631 states, 16630 states have (on average 1.418340348767288) internal successors, (23587), 16630 states have internal predecessors, (23587), 0 states have call successors, (0), 0 states 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:06:16,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16631 states to 16631 states and 23587 transitions. [2025-03-03 15:06:16,796 INFO L78 Accepts]: Start accepts. Automaton has 16631 states and 23587 transitions. Word has length 62 [2025-03-03 15:06:16,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:16,796 INFO L471 AbstractCegarLoop]: Abstraction has 16631 states and 23587 transitions. [2025-03-03 15:06:16,796 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:06:16,796 INFO L276 IsEmpty]: Start isEmpty. Operand 16631 states and 23587 transitions. [2025-03-03 15:06:16,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 15:06:16,797 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:16,797 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:06:16,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:06:16,798 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:16,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:16,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1227232871, now seen corresponding path program 1 times [2025-03-03 15:06:16,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:16,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899994026] [2025-03-03 15:06:16,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:16,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:16,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 15:06:16,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 15:06:16,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:16,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:16,865 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 15:06:16,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:16,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899994026] [2025-03-03 15:06:16,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899994026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:16,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:16,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:06:16,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401851491] [2025-03-03 15:06:16,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:16,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:06:16,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:16,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:06:16,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:06:16,867 INFO L87 Difference]: Start difference. First operand 16631 states and 23587 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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:06:16,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:16,997 INFO L93 Difference]: Finished difference Result 34124 states and 48777 transitions. [2025-03-03 15:06:16,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:06:16,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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 62 [2025-03-03 15:06:16,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:17,041 INFO L225 Difference]: With dead ends: 34124 [2025-03-03 15:06:17,042 INFO L226 Difference]: Without dead ends: 27298 [2025-03-03 15:06:17,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:06:17,051 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 339 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:17,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 583 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:06:17,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27298 states. [2025-03-03 15:06:17,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27298 to 23204. [2025-03-03 15:06:17,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23204 states, 23203 states have (on average 1.4136534068870406) internal successors, (32801), 23203 states have internal predecessors, (32801), 0 states have call successors, (0), 0 states 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:06:17,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23204 states to 23204 states and 32801 transitions. [2025-03-03 15:06:17,493 INFO L78 Accepts]: Start accepts. Automaton has 23204 states and 32801 transitions. Word has length 62 [2025-03-03 15:06:17,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:17,493 INFO L471 AbstractCegarLoop]: Abstraction has 23204 states and 32801 transitions. [2025-03-03 15:06:17,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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:06:17,494 INFO L276 IsEmpty]: Start isEmpty. Operand 23204 states and 32801 transitions. [2025-03-03 15:06:17,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 15:06:17,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:17,496 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:06:17,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:06:17,496 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:17,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:17,497 INFO L85 PathProgramCache]: Analyzing trace with hash 625206657, now seen corresponding path program 1 times [2025-03-03 15:06:17,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:17,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025031283] [2025-03-03 15:06:17,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:17,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:17,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 15:06:17,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 15:06:17,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:17,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:17,599 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:17,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:17,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025031283] [2025-03-03 15:06:17,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025031283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:17,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:17,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:06:17,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856203623] [2025-03-03 15:06:17,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:17,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:06:17,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:17,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:06:17,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:06:17,601 INFO L87 Difference]: Start difference. First operand 23204 states and 32801 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:06:17,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:17,663 INFO L93 Difference]: Finished difference Result 40499 states and 57071 transitions. [2025-03-03 15:06:17,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:06:17,663 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:06:17,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:17,696 INFO L225 Difference]: With dead ends: 40499 [2025-03-03 15:06:17,696 INFO L226 Difference]: Without dead ends: 24153 [2025-03-03 15:06:17,712 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:06:17,713 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 67 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:17,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 269 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:06:17,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24153 states. [2025-03-03 15:06:17,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24153 to 21791. [2025-03-03 15:06:18,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21791 states, 21790 states have (on average 1.3913721890775586) internal successors, (30318), 21790 states have internal predecessors, (30318), 0 states have call successors, (0), 0 states 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:06:18,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21791 states to 21791 states and 30318 transitions. [2025-03-03 15:06:18,040 INFO L78 Accepts]: Start accepts. Automaton has 21791 states and 30318 transitions. Word has length 62 [2025-03-03 15:06:18,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:18,040 INFO L471 AbstractCegarLoop]: Abstraction has 21791 states and 30318 transitions. [2025-03-03 15:06:18,040 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:06:18,040 INFO L276 IsEmpty]: Start isEmpty. Operand 21791 states and 30318 transitions. [2025-03-03 15:06:18,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 15:06:18,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:18,042 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:06:18,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:06:18,042 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:18,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:18,042 INFO L85 PathProgramCache]: Analyzing trace with hash 513504713, now seen corresponding path program 1 times [2025-03-03 15:06:18,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:18,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361337861] [2025-03-03 15:06:18,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:18,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:18,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 15:06:18,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 15:06:18,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:18,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:18,108 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 15:06:18,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:18,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361337861] [2025-03-03 15:06:18,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361337861] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:18,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:18,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:06:18,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140840500] [2025-03-03 15:06:18,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:18,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:06:18,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:18,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:06:18,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:06:18,110 INFO L87 Difference]: Start difference. First operand 21791 states and 30318 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 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:06:18,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:18,196 INFO L93 Difference]: Finished difference Result 39731 states and 55908 transitions. [2025-03-03 15:06:18,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:06:18,197 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 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 62 [2025-03-03 15:06:18,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:18,235 INFO L225 Difference]: With dead ends: 39731 [2025-03-03 15:06:18,236 INFO L226 Difference]: Without dead ends: 32064 [2025-03-03 15:06:18,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:06:18,250 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 339 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:18,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 547 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:06:18,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32064 states. [2025-03-03 15:06:18,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32064 to 27936. [2025-03-03 15:06:18,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27936 states, 27935 states have (on average 1.3867907642742079) internal successors, (38740), 27935 states have internal predecessors, (38740), 0 states have call successors, (0), 0 states 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:06:18,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27936 states to 27936 states and 38740 transitions. [2025-03-03 15:06:18,721 INFO L78 Accepts]: Start accepts. Automaton has 27936 states and 38740 transitions. Word has length 62 [2025-03-03 15:06:18,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:18,721 INFO L471 AbstractCegarLoop]: Abstraction has 27936 states and 38740 transitions. [2025-03-03 15:06:18,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 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:06:18,721 INFO L276 IsEmpty]: Start isEmpty. Operand 27936 states and 38740 transitions. [2025-03-03 15:06:18,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 15:06:18,723 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:18,723 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:06:18,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:06:18,723 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:18,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:18,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1108496901, now seen corresponding path program 1 times [2025-03-03 15:06:18,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:18,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095247974] [2025-03-03 15:06:18,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:18,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:18,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 15:06:18,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 15:06:18,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:18,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:18,807 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 15:06:18,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:18,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095247974] [2025-03-03 15:06:18,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095247974] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:18,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:18,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:06:18,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450687434] [2025-03-03 15:06:18,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:18,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:06:18,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:18,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:06:18,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:06:18,808 INFO L87 Difference]: Start difference. First operand 27936 states and 38740 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:06:18,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:18,980 INFO L93 Difference]: Finished difference Result 54882 states and 76227 transitions. [2025-03-03 15:06:18,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:06:18,981 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 63 [2025-03-03 15:06:18,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:19,014 INFO L225 Difference]: With dead ends: 54882 [2025-03-03 15:06:19,015 INFO L226 Difference]: Without dead ends: 27053 [2025-03-03 15:06:19,027 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:06:19,027 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 79 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:19,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 100 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:06:19,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27053 states. [2025-03-03 15:06:19,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27053 to 26821. [2025-03-03 15:06:19,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26821 states, 26820 states have (on average 1.377330350484713) internal successors, (36940), 26820 states have internal predecessors, (36940), 0 states have call successors, (0), 0 states 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:06:19,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26821 states to 26821 states and 36940 transitions. [2025-03-03 15:06:19,317 INFO L78 Accepts]: Start accepts. Automaton has 26821 states and 36940 transitions. Word has length 63 [2025-03-03 15:06:19,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:19,317 INFO L471 AbstractCegarLoop]: Abstraction has 26821 states and 36940 transitions. [2025-03-03 15:06:19,317 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:06:19,317 INFO L276 IsEmpty]: Start isEmpty. Operand 26821 states and 36940 transitions. [2025-03-03 15:06:19,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 15:06:19,319 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:19,319 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:06:19,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:06:19,319 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:19,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:19,320 INFO L85 PathProgramCache]: Analyzing trace with hash 821165725, now seen corresponding path program 1 times [2025-03-03 15:06:19,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:19,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599619250] [2025-03-03 15:06:19,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:19,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:19,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 15:06:19,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 15:06:19,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:19,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:19,399 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 15:06:19,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:19,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599619250] [2025-03-03 15:06:19,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599619250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:19,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:19,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:06:19,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480172216] [2025-03-03 15:06:19,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:19,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:06:19,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:19,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:06:19,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:06:19,401 INFO L87 Difference]: Start difference. First operand 26821 states and 36940 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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:06:19,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:19,510 INFO L93 Difference]: Finished difference Result 38179 states and 53168 transitions. [2025-03-03 15:06:19,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:06:19,511 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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 63 [2025-03-03 15:06:19,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:19,552 INFO L225 Difference]: With dead ends: 38179 [2025-03-03 15:06:19,552 INFO L226 Difference]: Without dead ends: 34357 [2025-03-03 15:06:19,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:06:19,566 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 336 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:19,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 547 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:06:19,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34357 states. [2025-03-03 15:06:19,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34357 to 30503. [2025-03-03 15:06:19,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30503 states, 30502 states have (on average 1.379057111009114) internal successors, (42064), 30502 states have internal predecessors, (42064), 0 states have call successors, (0), 0 states 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:06:20,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30503 states to 30503 states and 42064 transitions. [2025-03-03 15:06:20,029 INFO L78 Accepts]: Start accepts. Automaton has 30503 states and 42064 transitions. Word has length 63 [2025-03-03 15:06:20,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:20,030 INFO L471 AbstractCegarLoop]: Abstraction has 30503 states and 42064 transitions. [2025-03-03 15:06:20,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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:06:20,030 INFO L276 IsEmpty]: Start isEmpty. Operand 30503 states and 42064 transitions. [2025-03-03 15:06:20,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 15:06:20,031 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:20,031 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:06:20,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:06:20,032 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:20,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:20,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1849935515, now seen corresponding path program 1 times [2025-03-03 15:06:20,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:20,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563938507] [2025-03-03 15:06:20,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:20,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:20,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 15:06:20,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 15:06:20,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:20,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:20,070 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:20,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:20,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563938507] [2025-03-03 15:06:20,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563938507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:20,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:20,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:06:20,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644482469] [2025-03-03 15:06:20,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:20,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:06:20,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:20,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:06:20,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:06:20,072 INFO L87 Difference]: Start difference. First operand 30503 states and 42064 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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:06:20,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:20,178 INFO L93 Difference]: Finished difference Result 75367 states and 103421 transitions. [2025-03-03 15:06:20,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:06:20,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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:06:20,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:20,383 INFO L225 Difference]: With dead ends: 75367 [2025-03-03 15:06:20,384 INFO L226 Difference]: Without dead ends: 46631 [2025-03-03 15:06:20,401 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:06:20,402 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 61 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 255 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:06:20,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 255 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:06:20,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46631 states. [2025-03-03 15:06:20,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46631 to 44674. [2025-03-03 15:06:20,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44674 states, 44673 states have (on average 1.355046672486737) internal successors, (60534), 44673 states have internal predecessors, (60534), 0 states have call successors, (0), 0 states 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:06:20,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44674 states to 44674 states and 60534 transitions. [2025-03-03 15:06:20,804 INFO L78 Accepts]: Start accepts. Automaton has 44674 states and 60534 transitions. Word has length 65 [2025-03-03 15:06:20,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:20,804 INFO L471 AbstractCegarLoop]: Abstraction has 44674 states and 60534 transitions. [2025-03-03 15:06:20,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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:06:20,804 INFO L276 IsEmpty]: Start isEmpty. Operand 44674 states and 60534 transitions. [2025-03-03 15:06:20,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 15:06:20,806 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:20,806 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:06:20,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 15:06:20,806 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:20,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:20,807 INFO L85 PathProgramCache]: Analyzing trace with hash 492312289, now seen corresponding path program 1 times [2025-03-03 15:06:20,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:20,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650441398] [2025-03-03 15:06:20,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:20,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:20,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 15:06:20,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 15:06:20,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:20,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:20,886 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:20,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:20,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650441398] [2025-03-03 15:06:20,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650441398] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:06:20,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438184813] [2025-03-03 15:06:20,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:20,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:06:20,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:06:20,889 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:06:20,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 15:06:20,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 15:06:20,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 15:06:20,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:20,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:20,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 15:06:20,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:06:21,106 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:21,106 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:06:21,180 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:21,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438184813] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:06:21,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:06:21,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-03 15:06:21,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311441880] [2025-03-03 15:06:21,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:06:21,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 15:06:21,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:21,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 15:06:21,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:06:21,181 INFO L87 Difference]: Start difference. First operand 44674 states and 60534 transitions. Second operand has 11 states, 11 states have (on average 10.545454545454545) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:06:21,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:21,430 INFO L93 Difference]: Finished difference Result 91041 states and 123298 transitions. [2025-03-03 15:06:21,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:06:21,430 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.545454545454545) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 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:06:21,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:21,510 INFO L225 Difference]: With dead ends: 91041 [2025-03-03 15:06:21,510 INFO L226 Difference]: Without dead ends: 68055 [2025-03-03 15:06:21,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 124 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-03-03 15:06:21,541 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 667 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:21,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 255 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:06:21,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68055 states. [2025-03-03 15:06:22,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68055 to 53150. [2025-03-03 15:06:22,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53150 states, 53149 states have (on average 1.3514459350128882) internal successors, (71828), 53149 states have internal predecessors, (71828), 0 states have call successors, (0), 0 states 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:06:22,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53150 states to 53150 states and 71828 transitions. [2025-03-03 15:06:22,572 INFO L78 Accepts]: Start accepts. Automaton has 53150 states and 71828 transitions. Word has length 67 [2025-03-03 15:06:22,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:22,572 INFO L471 AbstractCegarLoop]: Abstraction has 53150 states and 71828 transitions. [2025-03-03 15:06:22,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.545454545454545) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:06:22,572 INFO L276 IsEmpty]: Start isEmpty. Operand 53150 states and 71828 transitions. [2025-03-03 15:06:22,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 15:06:22,578 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:22,578 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:06:22,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 15:06:22,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-03 15:06:22,779 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:22,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:22,780 INFO L85 PathProgramCache]: Analyzing trace with hash -439711677, now seen corresponding path program 1 times [2025-03-03 15:06:22,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:22,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672091734] [2025-03-03 15:06:22,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:22,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:22,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 15:06:22,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 15:06:22,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:22,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:22,852 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:22,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:22,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672091734] [2025-03-03 15:06:22,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672091734] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:06:22,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079133870] [2025-03-03 15:06:22,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:22,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:06:22,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:06:22,856 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:06:22,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 15:06:22,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 15:06:22,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 15:06:22,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:22,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:22,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 15:06:22,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:06:23,076 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:23,077 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:06:23,151 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:23,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079133870] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:06:23,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:06:23,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-03 15:06:23,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608751534] [2025-03-03 15:06:23,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:06:23,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 15:06:23,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:23,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 15:06:23,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:06:23,153 INFO L87 Difference]: Start difference. First operand 53150 states and 71828 transitions. Second operand has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states 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:06:23,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:23,449 INFO L93 Difference]: Finished difference Result 105169 states and 141599 transitions. [2025-03-03 15:06:23,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:06:23,449 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 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:06:23,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:23,516 INFO L225 Difference]: With dead ends: 105169 [2025-03-03 15:06:23,516 INFO L226 Difference]: Without dead ends: 58679 [2025-03-03 15:06:23,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 124 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-03 15:06:23,552 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 508 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:23,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 240 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:06:23,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58679 states. [2025-03-03 15:06:24,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58679 to 53594. [2025-03-03 15:06:24,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53594 states, 53593 states have (on average 1.34608997443696) internal successors, (72141), 53593 states have internal predecessors, (72141), 0 states have call successors, (0), 0 states 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:06:24,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53594 states to 53594 states and 72141 transitions. [2025-03-03 15:06:24,276 INFO L78 Accepts]: Start accepts. Automaton has 53594 states and 72141 transitions. Word has length 67 [2025-03-03 15:06:24,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:24,276 INFO L471 AbstractCegarLoop]: Abstraction has 53594 states and 72141 transitions. [2025-03-03 15:06:24,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states 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:06:24,277 INFO L276 IsEmpty]: Start isEmpty. Operand 53594 states and 72141 transitions. [2025-03-03 15:06:24,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 15:06:24,279 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:24,279 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:06:24,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 15:06:24,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:06:24,479 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:24,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:24,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1808156569, now seen corresponding path program 1 times [2025-03-03 15:06:24,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:24,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017877420] [2025-03-03 15:06:24,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:24,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:24,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 15:06:24,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 15:06:24,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:24,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:24,566 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:24,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:24,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017877420] [2025-03-03 15:06:24,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017877420] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:06:24,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804012027] [2025-03-03 15:06:24,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:24,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:06:24,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:06:24,568 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:06:24,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 15:06:24,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 15:06:24,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 15:06:24,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:24,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:24,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 15:06:24,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:06:24,783 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:24,783 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:06:24,855 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:24,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804012027] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:06:24,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:06:24,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-03 15:06:24,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140925187] [2025-03-03 15:06:24,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:06:24,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 15:06:24,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:24,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 15:06:24,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:06:24,856 INFO L87 Difference]: Start difference. First operand 53594 states and 72141 transitions. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states 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:06:25,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:25,477 INFO L93 Difference]: Finished difference Result 146488 states and 198127 transitions. [2025-03-03 15:06:25,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:06:25,478 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 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:06:25,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:25,604 INFO L225 Difference]: With dead ends: 146488 [2025-03-03 15:06:25,604 INFO L226 Difference]: Without dead ends: 96878 [2025-03-03 15:06:25,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 126 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-03-03 15:06:25,641 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 1021 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1021 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:25,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1021 Valid, 351 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:06:25,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96878 states. [2025-03-03 15:06:26,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96878 to 62518. [2025-03-03 15:06:26,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62518 states, 62517 states have (on average 1.3491530303757377) internal successors, (84345), 62517 states have internal predecessors, (84345), 0 states have call successors, (0), 0 states 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:06:26,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62518 states to 62518 states and 84345 transitions. [2025-03-03 15:06:26,488 INFO L78 Accepts]: Start accepts. Automaton has 62518 states and 84345 transitions. Word has length 68 [2025-03-03 15:06:26,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:26,488 INFO L471 AbstractCegarLoop]: Abstraction has 62518 states and 84345 transitions. [2025-03-03 15:06:26,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states 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:06:26,488 INFO L276 IsEmpty]: Start isEmpty. Operand 62518 states and 84345 transitions. [2025-03-03 15:06:26,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 15:06:26,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:26,491 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:06:26,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 15:06:26,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-03 15:06:26,691 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:26,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:26,692 INFO L85 PathProgramCache]: Analyzing trace with hash -890218715, now seen corresponding path program 1 times [2025-03-03 15:06:26,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:26,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587885377] [2025-03-03 15:06:26,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:26,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:26,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 15:06:26,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 15:06:26,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:26,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:26,895 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:26,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:26,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587885377] [2025-03-03 15:06:26,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587885377] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:06:26,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810179112] [2025-03-03 15:06:26,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:26,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:06:26,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:06:26,897 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:06:26,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 15:06:26,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 15:06:26,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 15:06:26,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:26,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:26,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 15:06:26,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:06:27,402 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:27,402 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:06:27,785 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:27,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810179112] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:06:27,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:06:27,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-03 15:06:27,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838936418] [2025-03-03 15:06:27,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:06:27,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 15:06:27,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:27,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 15:06:27,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2025-03-03 15:06:27,787 INFO L87 Difference]: Start difference. First operand 62518 states and 84345 transitions. Second operand has 21 states, 21 states have (on average 7.761904761904762) internal successors, (163), 20 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:28,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:28,898 INFO L93 Difference]: Finished difference Result 291997 states and 392387 transitions. [2025-03-03 15:06:28,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-03 15:06:28,899 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 7.761904761904762) internal successors, (163), 20 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-03 15:06:28,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:29,199 INFO L225 Difference]: With dead ends: 291997 [2025-03-03 15:06:29,199 INFO L226 Difference]: Without dead ends: 229586 [2025-03-03 15:06:29,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=449, Invalid=1357, Unknown=0, NotChecked=0, Total=1806 [2025-03-03 15:06:29,285 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 1395 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1395 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:29,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1395 Valid, 889 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:06:29,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229586 states. [2025-03-03 15:06:31,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229586 to 139376. [2025-03-03 15:06:31,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139376 states, 139375 states have (on average 1.3383174887892377) internal successors, (186528), 139375 states have internal predecessors, (186528), 0 states have call successors, (0), 0 states 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:06:31,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139376 states to 139376 states and 186528 transitions. [2025-03-03 15:06:31,622 INFO L78 Accepts]: Start accepts. Automaton has 139376 states and 186528 transitions. Word has length 69 [2025-03-03 15:06:31,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:31,622 INFO L471 AbstractCegarLoop]: Abstraction has 139376 states and 186528 transitions. [2025-03-03 15:06:31,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 7.761904761904762) internal successors, (163), 20 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:31,623 INFO L276 IsEmpty]: Start isEmpty. Operand 139376 states and 186528 transitions. [2025-03-03 15:06:31,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 15:06:31,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:31,626 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:06:31,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 15:06:31,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:06:31,829 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:31,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:31,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1492244929, now seen corresponding path program 1 times [2025-03-03 15:06:31,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:31,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033061392] [2025-03-03 15:06:31,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:31,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:31,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 15:06:31,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 15:06:31,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:31,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:32,095 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:32,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:32,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033061392] [2025-03-03 15:06:32,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033061392] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:06:32,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031932003] [2025-03-03 15:06:32,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:32,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:06:32,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:06:32,097 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:06:32,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 15:06:32,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 15:06:32,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 15:06:32,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:32,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:32,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-03 15:06:32,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:06:33,085 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:33,085 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:06:34,178 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:34,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031932003] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:06:34,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:06:34,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 17] total 36 [2025-03-03 15:06:34,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196687640] [2025-03-03 15:06:34,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:06:34,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-03 15:06:34,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:34,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-03 15:06:34,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1058, Unknown=0, NotChecked=0, Total=1260 [2025-03-03 15:06:34,179 INFO L87 Difference]: Start difference. First operand 139376 states and 186528 transitions. Second operand has 36 states, 36 states have (on average 4.888888888888889) internal successors, (176), 36 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)