./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 22565549446fb10d699e81ca4083722d91d5f2743033fe3de4e7c76b9089640a --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:33:10,942 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:33:11,014 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:33:11,019 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:33:11,022 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:33:11,052 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:33:11,053 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:33:11,054 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:33:11,054 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:33:11,055 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:33:11,055 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:33:11,055 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:33:11,056 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:33:11,056 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:33:11,056 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:33:11,057 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:33:11,057 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:33:11,057 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:33:11,057 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:33:11,057 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:33:11,057 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:33:11,058 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:33:11,058 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:33:11,058 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:33:11,058 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:33:11,058 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:33:11,058 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:33:11,058 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:33:11,058 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:33:11,058 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:33:11,058 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:33:11,059 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:33:11,059 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:33:11,059 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:33:11,060 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:33:11,060 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:33:11,060 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:33:11,060 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:33:11,060 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:33:11,060 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:33:11,060 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:33:11,060 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:33:11,060 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:33:11,061 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-jdk21/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 -> 22565549446fb10d699e81ca4083722d91d5f2743033fe3de4e7c76b9089640a [2025-02-05 16:33:11,373 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:33:11,386 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:33:11,389 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:33:11,391 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:33:11,391 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:33:11,392 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-02-05 16:33:12,680 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7ef3c6d41/b56056dd62ba442c925cf0c468166404/FLAGb608359d5 [2025-02-05 16:33:13,004 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:33:13,005 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-02-05 16:33:13,021 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7ef3c6d41/b56056dd62ba442c925cf0c468166404/FLAGb608359d5 [2025-02-05 16:33:13,240 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7ef3c6d41/b56056dd62ba442c925cf0c468166404 [2025-02-05 16:33:13,242 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:33:13,243 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:33:13,244 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:33:13,245 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:33:13,248 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:33:13,249 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:33:13" (1/1) ... [2025-02-05 16:33:13,250 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d36fc0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:33:13, skipping insertion in model container [2025-02-05 16:33:13,250 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:33:13" (1/1) ... [2025-02-05 16:33:13,280 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:33:13,503 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[7163,7176] [2025-02-05 16:33:13,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:33:13,570 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:33:13,629 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[7163,7176] [2025-02-05 16:33:13,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:33:13,666 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:33:13,667 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:33:13 WrapperNode [2025-02-05 16:33:13,667 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:33:13,668 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:33:13,668 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:33:13,668 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:33:13,673 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:33:13" (1/1) ... [2025-02-05 16:33:13,682 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:33:13" (1/1) ... [2025-02-05 16:33:13,712 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 644 [2025-02-05 16:33:13,712 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:33:13,713 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:33:13,713 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:33:13,713 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:33:13,721 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:33:13" (1/1) ... [2025-02-05 16:33:13,721 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:33:13" (1/1) ... [2025-02-05 16:33:13,724 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:33:13" (1/1) ... [2025-02-05 16:33:13,746 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-02-05 16:33:13,750 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:33:13" (1/1) ... [2025-02-05 16:33:13,750 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:33:13" (1/1) ... [2025-02-05 16:33:13,759 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:33:13" (1/1) ... [2025-02-05 16:33:13,761 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:33:13" (1/1) ... [2025-02-05 16:33:13,768 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:33:13" (1/1) ... [2025-02-05 16:33:13,769 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:33:13" (1/1) ... [2025-02-05 16:33:13,781 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:33:13,782 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:33:13,782 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:33:13,782 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:33:13,783 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:33:13" (1/1) ... [2025-02-05 16:33:13,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:33:13,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:33:13,818 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 16:33:13,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 16:33:13,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:33:13,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:33:13,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:33:13,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:33:13,956 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:33:13,958 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:33:14,485 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L481: havoc main_~node1____CPAchecker_TMP_1~0#1; [2025-02-05 16:33:14,486 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L648: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-02-05 16:33:14,486 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L154: havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-02-05 16:33:14,486 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L453: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-02-05 16:33:14,486 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L932: havoc main_~node3____CPAchecker_TMP_1~1#1; [2025-02-05 16:33:14,486 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L767: havoc main_~node1____CPAchecker_TMP_1~1#1; [2025-02-05 16:33:14,486 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L306: havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1;havoc main_~node3__m3~1#1;havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-02-05 16:33:14,486 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L175: havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-02-05 16:33:14,486 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L590: havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-02-05 16:33:14,486 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L739: havoc main_~node1____CPAchecker_TMP_0~2#1; [2025-02-05 16:33:14,486 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1020: havoc main_~node1____CPAchecker_TMP_1~2#1; [2025-02-05 16:33:14,486 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L676: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-02-05 16:33:14,486 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L396: havoc main_~node1__m1~3#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-02-05 16:33:14,487 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L330: havoc main_~node2__m2~2#1; [2025-02-05 16:33:14,487 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L562: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-02-05 16:33:14,487 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L133: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-02-05 16:33:14,487 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L348: havoc main_~node3__m3~2#1; [2025-02-05 16:33:14,487 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L976: havoc main_~node2____CPAchecker_TMP_1~1#1; [2025-02-05 16:33:14,518 INFO L? ?]: Removed 81 outVars from TransFormulas that were not future-live. [2025-02-05 16:33:14,519 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:33:14,530 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:33:14,530 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:33:14,530 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:33:14 BoogieIcfgContainer [2025-02-05 16:33:14,531 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:33:14,533 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:33:14,533 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:33:14,537 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:33:14,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:33:13" (1/3) ... [2025-02-05 16:33:14,538 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16934807 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:33:14, skipping insertion in model container [2025-02-05 16:33:14,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:33:13" (2/3) ... [2025-02-05 16:33:14,538 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16934807 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:33:14, skipping insertion in model container [2025-02-05 16:33:14,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:33:14" (3/3) ... [2025-02-05 16:33:14,539 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-02-05 16:33:14,551 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:33:14,552 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c that has 1 procedures, 161 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-05 16:33:14,606 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:33:14,617 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;@4e523079, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:33:14,617 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:33:14,622 INFO L276 IsEmpty]: Start isEmpty. Operand has 161 states, 159 states have (on average 1.7044025157232705) internal successors, (271), 160 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:14,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-05 16:33:14,630 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:14,630 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:33:14,630 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:33:14,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:14,636 INFO L85 PathProgramCache]: Analyzing trace with hash 169172669, now seen corresponding path program 1 times [2025-02-05 16:33:14,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:14,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646298394] [2025-02-05 16:33:14,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:14,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:14,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-05 16:33:14,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-05 16:33:14,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:14,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:15,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:15,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:15,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646298394] [2025-02-05 16:33:15,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646298394] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:33:15,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:33:15,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:33:15,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192380409] [2025-02-05 16:33:15,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:33:15,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:33:15,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:15,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:33:15,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:33:15,169 INFO L87 Difference]: Start difference. First operand has 161 states, 159 states have (on average 1.7044025157232705) internal successors, (271), 160 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:15,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:33:15,399 INFO L93 Difference]: Finished difference Result 516 states and 834 transitions. [2025-02-05 16:33:15,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:33:15,401 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2025-02-05 16:33:15,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:33:15,414 INFO L225 Difference]: With dead ends: 516 [2025-02-05 16:33:15,415 INFO L226 Difference]: Without dead ends: 437 [2025-02-05 16:33:15,418 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-02-05 16:33:15,420 INFO L435 NwaCegarLoop]: 376 mSDtfsCounter, 908 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 1286 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:33:15,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [908 Valid, 1286 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:33:15,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2025-02-05 16:33:15,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 255. [2025-02-05 16:33:15,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 254 states have (on average 1.515748031496063) internal successors, (385), 254 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:15,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 385 transitions. [2025-02-05 16:33:15,491 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 385 transitions. Word has length 49 [2025-02-05 16:33:15,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:33:15,492 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 385 transitions. [2025-02-05 16:33:15,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:15,493 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 385 transitions. [2025-02-05 16:33:15,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-05 16:33:15,497 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:15,497 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:33:15,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:33:15,497 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:33:15,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:15,498 INFO L85 PathProgramCache]: Analyzing trace with hash -631698242, now seen corresponding path program 1 times [2025-02-05 16:33:15,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:15,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659621372] [2025-02-05 16:33:15,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:15,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:15,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-05 16:33:15,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-05 16:33:15,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:15,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:15,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:15,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:15,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659621372] [2025-02-05 16:33:15,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659621372] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:33:15,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:33:15,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:33:15,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096471750] [2025-02-05 16:33:15,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:33:15,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:33:15,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:15,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:33:15,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:33:15,645 INFO L87 Difference]: Start difference. First operand 255 states and 385 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:15,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:33:15,690 INFO L93 Difference]: Finished difference Result 627 states and 965 transitions. [2025-02-05 16:33:15,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:33:15,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2025-02-05 16:33:15,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:33:15,694 INFO L225 Difference]: With dead ends: 627 [2025-02-05 16:33:15,694 INFO L226 Difference]: Without dead ends: 429 [2025-02-05 16:33:15,695 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-02-05 16:33:15,696 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 160 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:33:15,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 422 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:33:15,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2025-02-05 16:33:15,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 427. [2025-02-05 16:33:15,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 426 states have (on average 1.5046948356807512) internal successors, (641), 426 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:15,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 641 transitions. [2025-02-05 16:33:15,727 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 641 transitions. Word has length 52 [2025-02-05 16:33:15,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:33:15,728 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 641 transitions. [2025-02-05 16:33:15,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:15,728 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 641 transitions. [2025-02-05 16:33:15,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-05 16:33:15,730 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:15,730 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:33:15,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:33:15,731 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:33:15,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:15,731 INFO L85 PathProgramCache]: Analyzing trace with hash 561756701, now seen corresponding path program 1 times [2025-02-05 16:33:15,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:15,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800699545] [2025-02-05 16:33:15,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:15,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:15,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-05 16:33:15,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-05 16:33:15,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:15,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:15,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:15,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:15,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800699545] [2025-02-05 16:33:15,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800699545] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:33:15,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:33:15,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:33:15,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069868339] [2025-02-05 16:33:15,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:33:15,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:33:15,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:15,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:33:15,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:33:15,860 INFO L87 Difference]: Start difference. First operand 427 states and 641 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:15,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:33:15,896 INFO L93 Difference]: Finished difference Result 1077 states and 1638 transitions. [2025-02-05 16:33:15,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:33:15,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2025-02-05 16:33:15,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:33:15,901 INFO L225 Difference]: With dead ends: 1077 [2025-02-05 16:33:15,901 INFO L226 Difference]: Without dead ends: 749 [2025-02-05 16:33:15,903 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-02-05 16:33:15,904 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 159 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:33:15,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 436 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:33:15,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2025-02-05 16:33:15,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 747. [2025-02-05 16:33:15,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 747 states, 746 states have (on average 1.4946380697050938) internal successors, (1115), 746 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:15,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1115 transitions. [2025-02-05 16:33:15,934 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1115 transitions. Word has length 52 [2025-02-05 16:33:15,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:33:15,936 INFO L471 AbstractCegarLoop]: Abstraction has 747 states and 1115 transitions. [2025-02-05 16:33:15,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:15,936 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1115 transitions. [2025-02-05 16:33:15,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-05 16:33:15,939 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:15,939 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:33:15,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:33:15,939 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:33:15,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:15,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1798054174, now seen corresponding path program 1 times [2025-02-05 16:33:15,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:15,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858172126] [2025-02-05 16:33:15,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:15,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:15,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-05 16:33:15,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-05 16:33:15,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:15,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:16,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:16,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:16,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858172126] [2025-02-05 16:33:16,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858172126] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:33:16,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:33:16,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:33:16,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203723242] [2025-02-05 16:33:16,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:33:16,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:33:16,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:16,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:33:16,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:33:16,044 INFO L87 Difference]: Start difference. First operand 747 states and 1115 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:16,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:33:16,089 INFO L93 Difference]: Finished difference Result 1857 states and 2792 transitions. [2025-02-05 16:33:16,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:33:16,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2025-02-05 16:33:16,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:33:16,097 INFO L225 Difference]: With dead ends: 1857 [2025-02-05 16:33:16,097 INFO L226 Difference]: Without dead ends: 1293 [2025-02-05 16:33:16,098 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-02-05 16:33:16,101 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 146 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:33:16,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 436 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:33:16,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1293 states. [2025-02-05 16:33:16,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1293 to 1291. [2025-02-05 16:33:16,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1291 states, 1290 states have (on average 1.4751937984496124) internal successors, (1903), 1290 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:16,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1903 transitions. [2025-02-05 16:33:16,154 INFO L78 Accepts]: Start accepts. Automaton has 1291 states and 1903 transitions. Word has length 52 [2025-02-05 16:33:16,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:33:16,154 INFO L471 AbstractCegarLoop]: Abstraction has 1291 states and 1903 transitions. [2025-02-05 16:33:16,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:16,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1903 transitions. [2025-02-05 16:33:16,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-05 16:33:16,158 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:16,158 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:33:16,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:33:16,159 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:33:16,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:16,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1950817686, now seen corresponding path program 1 times [2025-02-05 16:33:16,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:16,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907971810] [2025-02-05 16:33:16,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:16,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:16,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-05 16:33:16,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-05 16:33:16,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:16,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:16,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:16,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:16,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907971810] [2025-02-05 16:33:16,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907971810] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:33:16,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:33:16,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:33:16,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342687767] [2025-02-05 16:33:16,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:33:16,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:33:16,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:16,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:33:16,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:33:16,321 INFO L87 Difference]: Start difference. First operand 1291 states and 1903 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:16,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:33:16,454 INFO L93 Difference]: Finished difference Result 2511 states and 3768 transitions. [2025-02-05 16:33:16,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:33:16,454 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2025-02-05 16:33:16,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:33:16,463 INFO L225 Difference]: With dead ends: 2511 [2025-02-05 16:33:16,463 INFO L226 Difference]: Without dead ends: 2145 [2025-02-05 16:33:16,465 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-02-05 16:33:16,465 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 639 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:33:16,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [639 Valid, 964 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:33:16,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2145 states. [2025-02-05 16:33:16,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2145 to 1740. [2025-02-05 16:33:16,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1740 states, 1739 states have (on average 1.4836112708453133) internal successors, (2580), 1739 states have internal predecessors, (2580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:16,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1740 states to 1740 states and 2580 transitions. [2025-02-05 16:33:16,515 INFO L78 Accepts]: Start accepts. Automaton has 1740 states and 2580 transitions. Word has length 53 [2025-02-05 16:33:16,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:33:16,517 INFO L471 AbstractCegarLoop]: Abstraction has 1740 states and 2580 transitions. [2025-02-05 16:33:16,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:16,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1740 states and 2580 transitions. [2025-02-05 16:33:16,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-05 16:33:16,518 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:16,518 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:33:16,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:33:16,518 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:33:16,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:16,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1013738654, now seen corresponding path program 1 times [2025-02-05 16:33:16,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:16,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117680801] [2025-02-05 16:33:16,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:16,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:16,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-05 16:33:16,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-05 16:33:16,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:16,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:16,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:16,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:16,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117680801] [2025-02-05 16:33:16,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117680801] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:33:16,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:33:16,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:33:16,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268983511] [2025-02-05 16:33:16,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:33:16,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:33:16,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:16,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:33:16,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:33:16,682 INFO L87 Difference]: Start difference. First operand 1740 states and 2580 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:16,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:33:16,786 INFO L93 Difference]: Finished difference Result 2960 states and 4445 transitions. [2025-02-05 16:33:16,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:33:16,787 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2025-02-05 16:33:16,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:33:16,799 INFO L225 Difference]: With dead ends: 2960 [2025-02-05 16:33:16,799 INFO L226 Difference]: Without dead ends: 2594 [2025-02-05 16:33:16,801 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-02-05 16:33:16,803 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 636 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:33:16,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 996 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:33:16,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2594 states. [2025-02-05 16:33:16,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2594 to 2075. [2025-02-05 16:33:16,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2075 states, 2074 states have (on average 1.488910318225651) internal successors, (3088), 2074 states have internal predecessors, (3088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:16,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2075 states to 2075 states and 3088 transitions. [2025-02-05 16:33:16,872 INFO L78 Accepts]: Start accepts. Automaton has 2075 states and 3088 transitions. Word has length 53 [2025-02-05 16:33:16,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:33:16,873 INFO L471 AbstractCegarLoop]: Abstraction has 2075 states and 3088 transitions. [2025-02-05 16:33:16,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:16,874 INFO L276 IsEmpty]: Start isEmpty. Operand 2075 states and 3088 transitions. [2025-02-05 16:33:16,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-05 16:33:16,876 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:16,876 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:33:16,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:33:16,876 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:33:16,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:16,876 INFO L85 PathProgramCache]: Analyzing trace with hash -804633783, now seen corresponding path program 1 times [2025-02-05 16:33:16,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:16,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561159487] [2025-02-05 16:33:16,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:16,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:16,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-05 16:33:16,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-05 16:33:16,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:16,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:17,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:17,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:17,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561159487] [2025-02-05 16:33:17,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561159487] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:33:17,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:33:17,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:33:17,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225900461] [2025-02-05 16:33:17,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:33:17,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:33:17,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:17,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:33:17,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:33:17,024 INFO L87 Difference]: Start difference. First operand 2075 states and 3088 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:17,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:33:17,113 INFO L93 Difference]: Finished difference Result 3359 states and 5045 transitions. [2025-02-05 16:33:17,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:33:17,114 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2025-02-05 16:33:17,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:33:17,124 INFO L225 Difference]: With dead ends: 3359 [2025-02-05 16:33:17,124 INFO L226 Difference]: Without dead ends: 2993 [2025-02-05 16:33:17,126 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-02-05 16:33:17,126 INFO L435 NwaCegarLoop]: 439 mSDtfsCounter, 630 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:33:17,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 1069 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:33:17,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2993 states. [2025-02-05 16:33:17,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2993 to 2375. [2025-02-05 16:33:17,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2375 states, 2374 states have (on average 1.4928390901432183) internal successors, (3544), 2374 states have internal predecessors, (3544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:17,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2375 states to 2375 states and 3544 transitions. [2025-02-05 16:33:17,192 INFO L78 Accepts]: Start accepts. Automaton has 2375 states and 3544 transitions. Word has length 53 [2025-02-05 16:33:17,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:33:17,192 INFO L471 AbstractCegarLoop]: Abstraction has 2375 states and 3544 transitions. [2025-02-05 16:33:17,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:17,193 INFO L276 IsEmpty]: Start isEmpty. Operand 2375 states and 3544 transitions. [2025-02-05 16:33:17,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 16:33:17,195 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:17,195 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:33:17,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:33:17,195 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:33:17,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:17,196 INFO L85 PathProgramCache]: Analyzing trace with hash 142479573, now seen corresponding path program 1 times [2025-02-05 16:33:17,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:17,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859353536] [2025-02-05 16:33:17,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:17,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:17,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 16:33:17,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 16:33:17,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:17,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:17,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:17,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:17,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859353536] [2025-02-05 16:33:17,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859353536] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:33:17,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:33:17,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:33:17,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169241370] [2025-02-05 16:33:17,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:33:17,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:33:17,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:17,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:33:17,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:33:17,322 INFO L87 Difference]: Start difference. First operand 2375 states and 3544 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:17,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:33:17,581 INFO L93 Difference]: Finished difference Result 5650 states and 8421 transitions. [2025-02-05 16:33:17,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:33:17,582 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-02-05 16:33:17,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:33:17,595 INFO L225 Difference]: With dead ends: 5650 [2025-02-05 16:33:17,595 INFO L226 Difference]: Without dead ends: 3302 [2025-02-05 16:33:17,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-02-05 16:33:17,600 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 902 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 902 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:33:17,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [902 Valid, 212 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:33:17,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3302 states. [2025-02-05 16:33:17,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3302 to 3275. [2025-02-05 16:33:17,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3275 states, 3274 states have (on average 1.4706780696395847) internal successors, (4815), 3274 states have internal predecessors, (4815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:17,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3275 states to 3275 states and 4815 transitions. [2025-02-05 16:33:17,693 INFO L78 Accepts]: Start accepts. Automaton has 3275 states and 4815 transitions. Word has length 57 [2025-02-05 16:33:17,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:33:17,693 INFO L471 AbstractCegarLoop]: Abstraction has 3275 states and 4815 transitions. [2025-02-05 16:33:17,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:17,694 INFO L276 IsEmpty]: Start isEmpty. Operand 3275 states and 4815 transitions. [2025-02-05 16:33:17,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 16:33:17,696 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:17,696 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:33:17,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:33:17,696 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:33:17,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:17,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1993367190, now seen corresponding path program 1 times [2025-02-05 16:33:17,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:17,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408724060] [2025-02-05 16:33:17,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:17,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:17,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 16:33:17,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 16:33:17,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:17,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:17,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:17,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:17,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408724060] [2025-02-05 16:33:17,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408724060] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:33:17,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:33:17,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:33:17,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501588222] [2025-02-05 16:33:17,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:33:17,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:33:17,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:17,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:33:17,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:33:17,814 INFO L87 Difference]: Start difference. First operand 3275 states and 4815 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:18,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:33:18,076 INFO L93 Difference]: Finished difference Result 7802 states and 11466 transitions. [2025-02-05 16:33:18,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:33:18,077 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-02-05 16:33:18,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:33:18,092 INFO L225 Difference]: With dead ends: 7802 [2025-02-05 16:33:18,092 INFO L226 Difference]: Without dead ends: 4572 [2025-02-05 16:33:18,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-02-05 16:33:18,102 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 888 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:33:18,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [888 Valid, 230 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:33:18,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4572 states. [2025-02-05 16:33:18,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4572 to 4547. [2025-02-05 16:33:18,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4547 states, 4546 states have (on average 1.457765068191817) internal successors, (6627), 4546 states have internal predecessors, (6627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:18,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4547 states to 4547 states and 6627 transitions. [2025-02-05 16:33:18,216 INFO L78 Accepts]: Start accepts. Automaton has 4547 states and 6627 transitions. Word has length 57 [2025-02-05 16:33:18,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:33:18,216 INFO L471 AbstractCegarLoop]: Abstraction has 4547 states and 6627 transitions. [2025-02-05 16:33:18,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:18,216 INFO L276 IsEmpty]: Start isEmpty. Operand 4547 states and 6627 transitions. [2025-02-05 16:33:18,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 16:33:18,220 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:18,220 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:33:18,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:33:18,220 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:33:18,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:18,222 INFO L85 PathProgramCache]: Analyzing trace with hash -93202369, now seen corresponding path program 1 times [2025-02-05 16:33:18,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:18,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273154506] [2025-02-05 16:33:18,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:18,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:18,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 16:33:18,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 16:33:18,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:18,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:18,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:18,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:18,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273154506] [2025-02-05 16:33:18,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273154506] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:33:18,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:33:18,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:33:18,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517626956] [2025-02-05 16:33:18,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:33:18,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:33:18,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:18,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:33:18,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:33:18,341 INFO L87 Difference]: Start difference. First operand 4547 states and 6627 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:18,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:33:18,584 INFO L93 Difference]: Finished difference Result 10777 states and 15690 transitions. [2025-02-05 16:33:18,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:33:18,585 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-02-05 16:33:18,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:33:18,608 INFO L225 Difference]: With dead ends: 10777 [2025-02-05 16:33:18,608 INFO L226 Difference]: Without dead ends: 6311 [2025-02-05 16:33:18,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-02-05 16:33:18,617 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 843 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:33:18,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [843 Valid, 232 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:33:18,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6311 states. [2025-02-05 16:33:18,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6311 to 6276. [2025-02-05 16:33:18,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6276 states, 6275 states have (on average 1.4422310756972112) internal successors, (9050), 6275 states have internal predecessors, (9050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:18,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6276 states to 6276 states and 9050 transitions. [2025-02-05 16:33:18,775 INFO L78 Accepts]: Start accepts. Automaton has 6276 states and 9050 transitions. Word has length 58 [2025-02-05 16:33:18,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:33:18,776 INFO L471 AbstractCegarLoop]: Abstraction has 6276 states and 9050 transitions. [2025-02-05 16:33:18,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:18,776 INFO L276 IsEmpty]: Start isEmpty. Operand 6276 states and 9050 transitions. [2025-02-05 16:33:18,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-05 16:33:18,780 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:18,780 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:33:18,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:33:18,780 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:33:18,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:18,781 INFO L85 PathProgramCache]: Analyzing trace with hash 920563705, now seen corresponding path program 1 times [2025-02-05 16:33:18,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:18,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711182744] [2025-02-05 16:33:18,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:18,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:18,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 16:33:18,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 16:33:18,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:18,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:18,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:18,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:18,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711182744] [2025-02-05 16:33:18,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711182744] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:33:18,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:33:18,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:33:18,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211794346] [2025-02-05 16:33:18,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:33:18,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:33:18,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:18,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:33:18,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:33:18,948 INFO L87 Difference]: Start difference. First operand 6276 states and 9050 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:19,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:33:19,320 INFO L93 Difference]: Finished difference Result 16400 states and 23480 transitions. [2025-02-05 16:33:19,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:33:19,321 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2025-02-05 16:33:19,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:33:19,360 INFO L225 Difference]: With dead ends: 16400 [2025-02-05 16:33:19,360 INFO L226 Difference]: Without dead ends: 13302 [2025-02-05 16:33:19,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:33:19,371 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 1288 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1288 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:33:19,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1288 Valid, 378 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:33:19,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13302 states. [2025-02-05 16:33:19,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13302 to 6370. [2025-02-05 16:33:19,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6370 states, 6369 states have (on average 1.4399434762129062) internal successors, (9171), 6369 states have internal predecessors, (9171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:19,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6370 states to 6370 states and 9171 transitions. [2025-02-05 16:33:19,599 INFO L78 Accepts]: Start accepts. Automaton has 6370 states and 9171 transitions. Word has length 59 [2025-02-05 16:33:19,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:33:19,600 INFO L471 AbstractCegarLoop]: Abstraction has 6370 states and 9171 transitions. [2025-02-05 16:33:19,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:19,600 INFO L276 IsEmpty]: Start isEmpty. Operand 6370 states and 9171 transitions. [2025-02-05 16:33:19,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-05 16:33:19,606 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:19,606 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:33:19,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:33:19,606 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:33:19,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:19,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1544172664, now seen corresponding path program 1 times [2025-02-05 16:33:19,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:19,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120436020] [2025-02-05 16:33:19,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:19,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:19,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 16:33:19,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 16:33:19,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:19,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:19,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:19,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:19,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120436020] [2025-02-05 16:33:19,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120436020] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:33:19,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:33:19,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:33:19,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144551633] [2025-02-05 16:33:19,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:33:19,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:33:19,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:19,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:33:19,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:33:19,763 INFO L87 Difference]: Start difference. First operand 6370 states and 9171 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:20,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:33:20,092 INFO L93 Difference]: Finished difference Result 14296 states and 20475 transitions. [2025-02-05 16:33:20,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:33:20,093 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2025-02-05 16:33:20,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:33:20,119 INFO L225 Difference]: With dead ends: 14296 [2025-02-05 16:33:20,119 INFO L226 Difference]: Without dead ends: 11050 [2025-02-05 16:33:20,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:33:20,129 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 1107 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1107 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:33:20,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1107 Valid, 330 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:33:20,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11050 states. [2025-02-05 16:33:20,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11050 to 6390. [2025-02-05 16:33:20,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6390 states, 6389 states have (on average 1.4391923618719675) internal successors, (9195), 6389 states have internal predecessors, (9195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:20,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6390 states to 6390 states and 9195 transitions. [2025-02-05 16:33:20,321 INFO L78 Accepts]: Start accepts. Automaton has 6390 states and 9195 transitions. Word has length 59 [2025-02-05 16:33:20,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:33:20,322 INFO L471 AbstractCegarLoop]: Abstraction has 6390 states and 9195 transitions. [2025-02-05 16:33:20,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:20,322 INFO L276 IsEmpty]: Start isEmpty. Operand 6390 states and 9195 transitions. [2025-02-05 16:33:20,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-05 16:33:20,326 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:20,326 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:33:20,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:33:20,326 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:33:20,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:20,327 INFO L85 PathProgramCache]: Analyzing trace with hash -382810438, now seen corresponding path program 1 times [2025-02-05 16:33:20,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:20,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492565436] [2025-02-05 16:33:20,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:20,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:20,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 16:33:20,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 16:33:20,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:20,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:20,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:20,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:20,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492565436] [2025-02-05 16:33:20,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492565436] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:33:20,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:33:20,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:33:20,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043088702] [2025-02-05 16:33:20,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:33:20,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:33:20,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:20,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:33:20,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:33:20,466 INFO L87 Difference]: Start difference. First operand 6390 states and 9195 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:20,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:33:20,871 INFO L93 Difference]: Finished difference Result 19083 states and 27326 transitions. [2025-02-05 16:33:20,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:33:20,872 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2025-02-05 16:33:20,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:33:20,911 INFO L225 Difference]: With dead ends: 19083 [2025-02-05 16:33:20,911 INFO L226 Difference]: Without dead ends: 15985 [2025-02-05 16:33:20,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:33:20,924 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 1445 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1445 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:33:20,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1445 Valid, 389 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:33:20,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15985 states. [2025-02-05 16:33:21,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15985 to 6446. [2025-02-05 16:33:21,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6446 states, 6445 states have (on average 1.4373933281613653) internal successors, (9264), 6445 states have internal predecessors, (9264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:21,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6446 states to 6446 states and 9264 transitions. [2025-02-05 16:33:21,104 INFO L78 Accepts]: Start accepts. Automaton has 6446 states and 9264 transitions. Word has length 59 [2025-02-05 16:33:21,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:33:21,105 INFO L471 AbstractCegarLoop]: Abstraction has 6446 states and 9264 transitions. [2025-02-05 16:33:21,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:21,105 INFO L276 IsEmpty]: Start isEmpty. Operand 6446 states and 9264 transitions. [2025-02-05 16:33:21,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-05 16:33:21,109 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:21,109 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:33:21,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:33:21,109 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:33:21,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:21,111 INFO L85 PathProgramCache]: Analyzing trace with hash 2046939638, now seen corresponding path program 1 times [2025-02-05 16:33:21,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:21,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537472776] [2025-02-05 16:33:21,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:21,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:21,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-05 16:33:21,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-05 16:33:21,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:21,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:21,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:21,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:21,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537472776] [2025-02-05 16:33:21,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537472776] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:33:21,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:33:21,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:33:21,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783176424] [2025-02-05 16:33:21,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:33:21,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:33:21,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:21,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:33:21,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:33:21,457 INFO L87 Difference]: Start difference. First operand 6446 states and 9264 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 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-02-05 16:33:22,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:33:22,086 INFO L93 Difference]: Finished difference Result 15299 states and 22049 transitions. [2025-02-05 16:33:22,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:33:22,087 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-02-05 16:33:22,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:33:22,109 INFO L225 Difference]: With dead ends: 15299 [2025-02-05 16:33:22,109 INFO L226 Difference]: Without dead ends: 10109 [2025-02-05 16:33:22,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-02-05 16:33:22,119 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 599 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:33:22,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 755 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:33:22,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10109 states. [2025-02-05 16:33:22,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10109 to 6318. [2025-02-05 16:33:22,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6318 states, 6317 states have (on average 1.434383409846446) internal successors, (9061), 6317 states have internal predecessors, (9061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:22,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6318 states to 6318 states and 9061 transitions. [2025-02-05 16:33:22,237 INFO L78 Accepts]: Start accepts. Automaton has 6318 states and 9061 transitions. Word has length 61 [2025-02-05 16:33:22,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:33:22,237 INFO L471 AbstractCegarLoop]: Abstraction has 6318 states and 9061 transitions. [2025-02-05 16:33:22,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 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-02-05 16:33:22,238 INFO L276 IsEmpty]: Start isEmpty. Operand 6318 states and 9061 transitions. [2025-02-05 16:33:22,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-05 16:33:22,241 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:22,241 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:33:22,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:33:22,241 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:33:22,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:22,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1011730185, now seen corresponding path program 1 times [2025-02-05 16:33:22,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:22,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214061155] [2025-02-05 16:33:22,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:22,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:22,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-05 16:33:22,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-05 16:33:22,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:22,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:22,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:22,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:22,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214061155] [2025-02-05 16:33:22,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214061155] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:33:22,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:33:22,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:33:22,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359152521] [2025-02-05 16:33:22,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:33:22,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:33:22,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:22,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:33:22,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:33:22,555 INFO L87 Difference]: Start difference. First operand 6318 states and 9061 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 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-02-05 16:33:23,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:33:23,227 INFO L93 Difference]: Finished difference Result 15339 states and 22038 transitions. [2025-02-05 16:33:23,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:33:23,228 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-02-05 16:33:23,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:33:23,250 INFO L225 Difference]: With dead ends: 15339 [2025-02-05 16:33:23,250 INFO L226 Difference]: Without dead ends: 10065 [2025-02-05 16:33:23,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-02-05 16:33:23,260 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 620 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:33:23,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 721 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:33:23,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10065 states. [2025-02-05 16:33:23,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10065 to 6129. [2025-02-05 16:33:23,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6129 states, 6128 states have (on average 1.4319516971279374) internal successors, (8775), 6128 states have internal predecessors, (8775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:23,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6129 states to 6129 states and 8775 transitions. [2025-02-05 16:33:23,390 INFO L78 Accepts]: Start accepts. Automaton has 6129 states and 8775 transitions. Word has length 61 [2025-02-05 16:33:23,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:33:23,390 INFO L471 AbstractCegarLoop]: Abstraction has 6129 states and 8775 transitions. [2025-02-05 16:33:23,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 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-02-05 16:33:23,391 INFO L276 IsEmpty]: Start isEmpty. Operand 6129 states and 8775 transitions. [2025-02-05 16:33:23,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-05 16:33:23,394 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:23,394 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:33:23,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:33:23,394 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:33:23,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:23,395 INFO L85 PathProgramCache]: Analyzing trace with hash -534799560, now seen corresponding path program 1 times [2025-02-05 16:33:23,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:23,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551719513] [2025-02-05 16:33:23,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:23,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:23,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-05 16:33:23,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-05 16:33:23,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:23,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:23,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:23,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:23,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551719513] [2025-02-05 16:33:23,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551719513] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:33:23,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:33:23,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:33:23,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492133081] [2025-02-05 16:33:23,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:33:23,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:33:23,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:23,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:33:23,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:33:23,724 INFO L87 Difference]: Start difference. First operand 6129 states and 8775 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 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-02-05 16:33:24,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:33:24,276 INFO L93 Difference]: Finished difference Result 14937 states and 21487 transitions. [2025-02-05 16:33:24,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:33:24,277 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-02-05 16:33:24,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:33:24,322 INFO L225 Difference]: With dead ends: 14937 [2025-02-05 16:33:24,322 INFO L226 Difference]: Without dead ends: 9719 [2025-02-05 16:33:24,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2025-02-05 16:33:24,329 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 1223 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1223 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:33:24,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1223 Valid, 747 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:33:24,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9719 states. [2025-02-05 16:33:24,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9719 to 5980. [2025-02-05 16:33:24,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5980 states, 5979 states have (on average 1.4323465462451914) internal successors, (8564), 5979 states have internal predecessors, (8564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:24,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5980 states to 5980 states and 8564 transitions. [2025-02-05 16:33:24,420 INFO L78 Accepts]: Start accepts. Automaton has 5980 states and 8564 transitions. Word has length 61 [2025-02-05 16:33:24,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:33:24,421 INFO L471 AbstractCegarLoop]: Abstraction has 5980 states and 8564 transitions. [2025-02-05 16:33:24,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 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-02-05 16:33:24,421 INFO L276 IsEmpty]: Start isEmpty. Operand 5980 states and 8564 transitions. [2025-02-05 16:33:24,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-05 16:33:24,423 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:24,424 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:33:24,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:33:24,424 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:33:24,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:24,425 INFO L85 PathProgramCache]: Analyzing trace with hash -50148285, now seen corresponding path program 1 times [2025-02-05 16:33:24,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:24,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937961954] [2025-02-05 16:33:24,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:24,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:24,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-05 16:33:24,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 16:33:24,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:24,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:24,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:24,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:24,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937961954] [2025-02-05 16:33:24,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937961954] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:33:24,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:33:24,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:33:24,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804803228] [2025-02-05 16:33:24,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:33:24,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:33:24,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:24,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:33:24,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:33:24,481 INFO L87 Difference]: Start difference. First operand 5980 states and 8564 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-02-05 16:33:24,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:33:24,520 INFO L93 Difference]: Finished difference Result 9027 states and 12937 transitions. [2025-02-05 16:33:24,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:33:24,520 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-02-05 16:33:24,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:33:24,532 INFO L225 Difference]: With dead ends: 9027 [2025-02-05 16:33:24,532 INFO L226 Difference]: Without dead ends: 5797 [2025-02-05 16:33:24,537 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-02-05 16:33:24,537 INFO L435 NwaCegarLoop]: 344 mSDtfsCounter, 150 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:33:24,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 526 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:33:24,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5797 states. [2025-02-05 16:33:24,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5797 to 5795. [2025-02-05 16:33:24,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5795 states, 5794 states have (on average 1.4126682775284778) internal successors, (8185), 5794 states have internal predecessors, (8185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:24,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5795 states to 5795 states and 8185 transitions. [2025-02-05 16:33:24,608 INFO L78 Accepts]: Start accepts. Automaton has 5795 states and 8185 transitions. Word has length 62 [2025-02-05 16:33:24,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:33:24,608 INFO L471 AbstractCegarLoop]: Abstraction has 5795 states and 8185 transitions. [2025-02-05 16:33:24,608 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-02-05 16:33:24,608 INFO L276 IsEmpty]: Start isEmpty. Operand 5795 states and 8185 transitions. [2025-02-05 16:33:24,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-05 16:33:24,611 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:24,611 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:33:24,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 16:33:24,611 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:33:24,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:24,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1110438627, now seen corresponding path program 1 times [2025-02-05 16:33:24,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:24,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072891040] [2025-02-05 16:33:24,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:24,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:24,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-05 16:33:24,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 16:33:24,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:24,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:24,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:24,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:24,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072891040] [2025-02-05 16:33:24,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072891040] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:33:24,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:33:24,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:33:24,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213032084] [2025-02-05 16:33:24,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:33:24,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:33:24,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:24,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:33:24,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:33:24,665 INFO L87 Difference]: Start difference. First operand 5795 states and 8185 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-02-05 16:33:24,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:33:24,696 INFO L93 Difference]: Finished difference Result 8089 states and 11426 transitions. [2025-02-05 16:33:24,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:33:24,696 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-02-05 16:33:24,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:33:24,705 INFO L225 Difference]: With dead ends: 8089 [2025-02-05 16:33:24,705 INFO L226 Difference]: Without dead ends: 4993 [2025-02-05 16:33:24,709 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-02-05 16:33:24,710 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 148 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:33:24,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 527 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:33:24,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4993 states. [2025-02-05 16:33:24,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4993 to 4991. [2025-02-05 16:33:24,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4991 states, 4990 states have (on average 1.3907815631262526) internal successors, (6940), 4990 states have internal predecessors, (6940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:24,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4991 states to 4991 states and 6940 transitions. [2025-02-05 16:33:24,764 INFO L78 Accepts]: Start accepts. Automaton has 4991 states and 6940 transitions. Word has length 62 [2025-02-05 16:33:24,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:33:24,765 INFO L471 AbstractCegarLoop]: Abstraction has 4991 states and 6940 transitions. [2025-02-05 16:33:24,765 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-02-05 16:33:24,765 INFO L276 IsEmpty]: Start isEmpty. Operand 4991 states and 6940 transitions. [2025-02-05 16:33:24,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-05 16:33:24,767 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:24,768 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:33:24,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 16:33:24,768 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:33:24,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:24,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1620668029, now seen corresponding path program 1 times [2025-02-05 16:33:24,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:24,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814774189] [2025-02-05 16:33:24,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:24,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:24,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-05 16:33:24,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 16:33:24,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:24,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:24,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:24,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:24,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814774189] [2025-02-05 16:33:24,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814774189] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:33:24,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:33:24,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:33:24,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923499159] [2025-02-05 16:33:24,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:33:24,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:33:24,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:24,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:33:24,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:33:24,822 INFO L87 Difference]: Start difference. First operand 4991 states and 6940 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-02-05 16:33:24,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:33:24,851 INFO L93 Difference]: Finished difference Result 6583 states and 9151 transitions. [2025-02-05 16:33:24,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:33:24,852 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-02-05 16:33:24,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:33:24,859 INFO L225 Difference]: With dead ends: 6583 [2025-02-05 16:33:24,859 INFO L226 Difference]: Without dead ends: 3858 [2025-02-05 16:33:24,862 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-02-05 16:33:24,862 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 136 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:33:24,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 514 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:33:24,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3858 states. [2025-02-05 16:33:24,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3858 to 3856. [2025-02-05 16:33:24,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3856 states, 3855 states have (on average 1.364461738002594) internal successors, (5260), 3855 states have internal predecessors, (5260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:24,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3856 states to 3856 states and 5260 transitions. [2025-02-05 16:33:24,906 INFO L78 Accepts]: Start accepts. Automaton has 3856 states and 5260 transitions. Word has length 62 [2025-02-05 16:33:24,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:33:24,907 INFO L471 AbstractCegarLoop]: Abstraction has 3856 states and 5260 transitions. [2025-02-05 16:33:24,907 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-02-05 16:33:24,907 INFO L276 IsEmpty]: Start isEmpty. Operand 3856 states and 5260 transitions. [2025-02-05 16:33:24,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-05 16:33:24,909 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:24,909 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:33:24,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 16:33:24,910 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:33:24,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:24,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1221170535, now seen corresponding path program 1 times [2025-02-05 16:33:24,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:24,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428585908] [2025-02-05 16:33:24,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:24,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:24,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 16:33:24,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 16:33:24,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:24,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:24,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:24,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:24,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428585908] [2025-02-05 16:33:24,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428585908] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:33:24,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:33:24,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:33:24,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855228011] [2025-02-05 16:33:24,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:33:24,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:33:24,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:24,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:33:24,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:33:24,952 INFO L87 Difference]: Start difference. First operand 3856 states and 5260 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:25,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:33:25,023 INFO L93 Difference]: Finished difference Result 7098 states and 9748 transitions. [2025-02-05 16:33:25,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:33:25,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-02-05 16:33:25,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:33:25,032 INFO L225 Difference]: With dead ends: 7098 [2025-02-05 16:33:25,032 INFO L226 Difference]: Without dead ends: 5192 [2025-02-05 16:33:25,035 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-02-05 16:33:25,036 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 179 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:33:25,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 351 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:33:25,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5192 states. [2025-02-05 16:33:25,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5192 to 3648. [2025-02-05 16:33:25,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3648 states, 3647 states have (on average 1.364409103372635) internal successors, (4976), 3647 states have internal predecessors, (4976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:25,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3648 states to 3648 states and 4976 transitions. [2025-02-05 16:33:25,083 INFO L78 Accepts]: Start accepts. Automaton has 3648 states and 4976 transitions. Word has length 63 [2025-02-05 16:33:25,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:33:25,083 INFO L471 AbstractCegarLoop]: Abstraction has 3648 states and 4976 transitions. [2025-02-05 16:33:25,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:25,084 INFO L276 IsEmpty]: Start isEmpty. Operand 3648 states and 4976 transitions. [2025-02-05 16:33:25,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-05 16:33:25,086 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:25,086 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:33:25,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 16:33:25,086 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:33:25,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:25,087 INFO L85 PathProgramCache]: Analyzing trace with hash -2072752705, now seen corresponding path program 1 times [2025-02-05 16:33:25,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:25,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009739372] [2025-02-05 16:33:25,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:25,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:25,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 16:33:25,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 16:33:25,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:25,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:25,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:25,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:25,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009739372] [2025-02-05 16:33:25,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009739372] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:33:25,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:33:25,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 16:33:25,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708134667] [2025-02-05 16:33:25,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:33:25,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:33:25,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:25,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:33:25,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:33:25,807 INFO L87 Difference]: Start difference. First operand 3648 states and 4976 transitions. Second operand has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:26,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:33:26,776 INFO L93 Difference]: Finished difference Result 7987 states and 10981 transitions. [2025-02-05 16:33:26,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 16:33:26,777 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-02-05 16:33:26,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:33:26,791 INFO L225 Difference]: With dead ends: 7987 [2025-02-05 16:33:26,791 INFO L226 Difference]: Without dead ends: 7635 [2025-02-05 16:33:26,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2025-02-05 16:33:26,794 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 1577 mSDsluCounter, 1410 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1577 SdHoareTripleChecker+Valid, 1635 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:33:26,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1577 Valid, 1635 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:33:26,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7635 states. [2025-02-05 16:33:26,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7635 to 3586. [2025-02-05 16:33:26,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3586 states, 3585 states have (on average 1.3648535564853557) internal successors, (4893), 3585 states have internal predecessors, (4893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:26,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3586 states to 3586 states and 4893 transitions. [2025-02-05 16:33:26,853 INFO L78 Accepts]: Start accepts. Automaton has 3586 states and 4893 transitions. Word has length 63 [2025-02-05 16:33:26,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:33:26,853 INFO L471 AbstractCegarLoop]: Abstraction has 3586 states and 4893 transitions. [2025-02-05 16:33:26,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:26,854 INFO L276 IsEmpty]: Start isEmpty. Operand 3586 states and 4893 transitions. [2025-02-05 16:33:26,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-05 16:33:26,856 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:26,856 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:33:26,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 16:33:26,857 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:33:26,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:26,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1210232511, now seen corresponding path program 1 times [2025-02-05 16:33:26,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:26,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58817757] [2025-02-05 16:33:26,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:26,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:26,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 16:33:26,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 16:33:26,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:26,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:27,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:27,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:27,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58817757] [2025-02-05 16:33:27,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58817757] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:33:27,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:33:27,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 16:33:27,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417600886] [2025-02-05 16:33:27,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:33:27,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:33:27,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:27,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:33:27,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:33:27,458 INFO L87 Difference]: Start difference. First operand 3586 states and 4893 transitions. Second operand has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:28,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:33:28,212 INFO L93 Difference]: Finished difference Result 5652 states and 7757 transitions. [2025-02-05 16:33:28,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 16:33:28,213 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-02-05 16:33:28,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:33:28,223 INFO L225 Difference]: With dead ends: 5652 [2025-02-05 16:33:28,223 INFO L226 Difference]: Without dead ends: 5302 [2025-02-05 16:33:28,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-02-05 16:33:28,229 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 1138 mSDsluCounter, 1588 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1138 SdHoareTripleChecker+Valid, 1811 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:33:28,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1138 Valid, 1811 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:33:28,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5302 states. [2025-02-05 16:33:28,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5302 to 3515. [2025-02-05 16:33:28,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3515 states, 3514 states have (on average 1.3636881047239613) internal successors, (4792), 3514 states have internal predecessors, (4792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:28,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3515 states to 3515 states and 4792 transitions. [2025-02-05 16:33:28,312 INFO L78 Accepts]: Start accepts. Automaton has 3515 states and 4792 transitions. Word has length 63 [2025-02-05 16:33:28,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:33:28,312 INFO L471 AbstractCegarLoop]: Abstraction has 3515 states and 4792 transitions. [2025-02-05 16:33:28,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:28,312 INFO L276 IsEmpty]: Start isEmpty. Operand 3515 states and 4792 transitions. [2025-02-05 16:33:28,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-05 16:33:28,315 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:28,315 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:33:28,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 16:33:28,315 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:33:28,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:28,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1408683063, now seen corresponding path program 1 times [2025-02-05 16:33:28,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:28,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119832077] [2025-02-05 16:33:28,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:28,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:28,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 16:33:28,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 16:33:28,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:28,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:28,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:28,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:28,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119832077] [2025-02-05 16:33:28,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119832077] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:33:28,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:33:28,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:33:28,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977761373] [2025-02-05 16:33:28,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:33:28,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:33:28,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:28,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:33:28,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:33:28,377 INFO L87 Difference]: Start difference. First operand 3515 states and 4792 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:28,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:33:28,427 INFO L93 Difference]: Finished difference Result 6588 states and 9040 transitions. [2025-02-05 16:33:28,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:33:28,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-02-05 16:33:28,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:33:28,436 INFO L225 Difference]: With dead ends: 6588 [2025-02-05 16:33:28,437 INFO L226 Difference]: Without dead ends: 4701 [2025-02-05 16:33:28,440 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-02-05 16:33:28,441 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 166 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:33:28,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 339 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:33:28,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4701 states. [2025-02-05 16:33:28,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4701 to 3326. [2025-02-05 16:33:28,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3326 states, 3325 states have (on average 1.3630075187969926) internal successors, (4532), 3325 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:28,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3326 states to 3326 states and 4532 transitions. [2025-02-05 16:33:28,494 INFO L78 Accepts]: Start accepts. Automaton has 3326 states and 4532 transitions. Word has length 63 [2025-02-05 16:33:28,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:33:28,494 INFO L471 AbstractCegarLoop]: Abstraction has 3326 states and 4532 transitions. [2025-02-05 16:33:28,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:28,495 INFO L276 IsEmpty]: Start isEmpty. Operand 3326 states and 4532 transitions. [2025-02-05 16:33:28,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 16:33:28,498 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:28,498 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:33:28,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 16:33:28,498 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:33:28,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:28,499 INFO L85 PathProgramCache]: Analyzing trace with hash -996650711, now seen corresponding path program 1 times [2025-02-05 16:33:28,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:28,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066377803] [2025-02-05 16:33:28,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:28,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:28,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 16:33:28,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 16:33:28,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:28,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:28,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:28,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:28,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066377803] [2025-02-05 16:33:28,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066377803] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:33:28,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:33:28,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:33:28,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659690127] [2025-02-05 16:33:28,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:33:28,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:33:28,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:28,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:33:28,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:33:28,612 INFO L87 Difference]: Start difference. First operand 3326 states and 4532 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:28,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:33:28,670 INFO L93 Difference]: Finished difference Result 3332 states and 4535 transitions. [2025-02-05 16:33:28,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:33:28,670 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-02-05 16:33:28,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:33:28,675 INFO L225 Difference]: With dead ends: 3332 [2025-02-05 16:33:28,675 INFO L226 Difference]: Without dead ends: 2857 [2025-02-05 16:33:28,676 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-02-05 16:33:28,677 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 556 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:33:28,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 542 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:33:28,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2857 states. [2025-02-05 16:33:28,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2857 to 2853. [2025-02-05 16:33:28,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2853 states, 2852 states have (on average 1.364305750350631) internal successors, (3891), 2852 states have internal predecessors, (3891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:28,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2853 states to 2853 states and 3891 transitions. [2025-02-05 16:33:28,705 INFO L78 Accepts]: Start accepts. Automaton has 2853 states and 3891 transitions. Word has length 67 [2025-02-05 16:33:28,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:33:28,706 INFO L471 AbstractCegarLoop]: Abstraction has 2853 states and 3891 transitions. [2025-02-05 16:33:28,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:28,706 INFO L276 IsEmpty]: Start isEmpty. Operand 2853 states and 3891 transitions. [2025-02-05 16:33:28,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-05 16:33:28,708 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:28,708 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:33:28,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 16:33:28,709 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:33:28,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:28,709 INFO L85 PathProgramCache]: Analyzing trace with hash 446783402, now seen corresponding path program 1 times [2025-02-05 16:33:28,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:28,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215632654] [2025-02-05 16:33:28,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:28,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:28,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 16:33:28,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 16:33:28,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:28,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:28,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:28,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:28,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215632654] [2025-02-05 16:33:28,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215632654] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:33:28,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:33:28,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:33:28,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96135781] [2025-02-05 16:33:28,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:33:28,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:33:28,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:28,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:33:28,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:33:28,799 INFO L87 Difference]: Start difference. First operand 2853 states and 3891 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:28,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:33:28,829 INFO L93 Difference]: Finished difference Result 7226 states and 9973 transitions. [2025-02-05 16:33:28,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:33:28,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-02-05 16:33:28,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:33:28,836 INFO L225 Difference]: With dead ends: 7226 [2025-02-05 16:33:28,836 INFO L226 Difference]: Without dead ends: 4937 [2025-02-05 16:33:28,839 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-02-05 16:33:28,839 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 118 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:33:28,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 438 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:33:28,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4937 states. [2025-02-05 16:33:28,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4937 to 4641. [2025-02-05 16:33:28,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4641 states, 4640 states have (on average 1.370905172413793) internal successors, (6361), 4640 states have internal predecessors, (6361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:28,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4641 states to 4641 states and 6361 transitions. [2025-02-05 16:33:28,888 INFO L78 Accepts]: Start accepts. Automaton has 4641 states and 6361 transitions. Word has length 70 [2025-02-05 16:33:28,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:33:28,890 INFO L471 AbstractCegarLoop]: Abstraction has 4641 states and 6361 transitions. [2025-02-05 16:33:28,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:28,890 INFO L276 IsEmpty]: Start isEmpty. Operand 4641 states and 6361 transitions. [2025-02-05 16:33:28,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-05 16:33:28,892 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:28,892 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:33:28,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 16:33:28,892 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:33:28,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:28,893 INFO L85 PathProgramCache]: Analyzing trace with hash -2143865666, now seen corresponding path program 1 times [2025-02-05 16:33:28,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:28,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032144759] [2025-02-05 16:33:28,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:28,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:28,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-05 16:33:28,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-05 16:33:28,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:28,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:28,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:28,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:28,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032144759] [2025-02-05 16:33:28,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032144759] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:33:28,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:33:28,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:33:28,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650143742] [2025-02-05 16:33:28,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:33:28,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:33:28,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:28,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:33:28,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:33:28,982 INFO L87 Difference]: Start difference. First operand 4641 states and 6361 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:29,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:33:29,020 INFO L93 Difference]: Finished difference Result 12385 states and 17067 transitions. [2025-02-05 16:33:29,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:33:29,020 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-02-05 16:33:29,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:33:29,032 INFO L225 Difference]: With dead ends: 12385 [2025-02-05 16:33:29,033 INFO L226 Difference]: Without dead ends: 8308 [2025-02-05 16:33:29,039 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-02-05 16:33:29,041 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 107 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:33:29,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 429 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:33:29,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8308 states. [2025-02-05 16:33:29,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8308 to 7718. [2025-02-05 16:33:29,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7718 states, 7717 states have (on average 1.3700920046650253) internal successors, (10573), 7717 states have internal predecessors, (10573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:29,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7718 states to 7718 states and 10573 transitions. [2025-02-05 16:33:29,127 INFO L78 Accepts]: Start accepts. Automaton has 7718 states and 10573 transitions. Word has length 71 [2025-02-05 16:33:29,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:33:29,127 INFO L471 AbstractCegarLoop]: Abstraction has 7718 states and 10573 transitions. [2025-02-05 16:33:29,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:29,127 INFO L276 IsEmpty]: Start isEmpty. Operand 7718 states and 10573 transitions. [2025-02-05 16:33:29,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-05 16:33:29,129 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:29,130 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:33:29,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-05 16:33:29,130 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:33:29,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:29,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1909575233, now seen corresponding path program 1 times [2025-02-05 16:33:29,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:29,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903326233] [2025-02-05 16:33:29,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:29,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:29,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-05 16:33:29,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-05 16:33:29,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:29,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:29,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:29,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:29,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903326233] [2025-02-05 16:33:29,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903326233] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:33:29,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:33:29,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:33:29,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216293102] [2025-02-05 16:33:29,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:33:29,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:33:29,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:29,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:33:29,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:33:29,217 INFO L87 Difference]: Start difference. First operand 7718 states and 10573 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:29,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:33:29,270 INFO L93 Difference]: Finished difference Result 21073 states and 28831 transitions. [2025-02-05 16:33:29,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:33:29,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-02-05 16:33:29,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:33:29,290 INFO L225 Difference]: With dead ends: 21073 [2025-02-05 16:33:29,291 INFO L226 Difference]: Without dead ends: 13840 [2025-02-05 16:33:29,302 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-02-05 16:33:29,303 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 150 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:33:29,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 364 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:33:29,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13840 states. [2025-02-05 16:33:29,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13840 to 13626. [2025-02-05 16:33:29,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13626 states, 13625 states have (on average 1.335045871559633) internal successors, (18190), 13625 states have internal predecessors, (18190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:29,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13626 states to 13626 states and 18190 transitions. [2025-02-05 16:33:29,454 INFO L78 Accepts]: Start accepts. Automaton has 13626 states and 18190 transitions. Word has length 73 [2025-02-05 16:33:29,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:33:29,454 INFO L471 AbstractCegarLoop]: Abstraction has 13626 states and 18190 transitions. [2025-02-05 16:33:29,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:29,454 INFO L276 IsEmpty]: Start isEmpty. Operand 13626 states and 18190 transitions. [2025-02-05 16:33:29,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-05 16:33:29,457 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:29,457 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:33:29,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-05 16:33:29,457 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:33:29,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:29,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1486873407, now seen corresponding path program 1 times [2025-02-05 16:33:29,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:29,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761642410] [2025-02-05 16:33:29,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:29,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:29,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-05 16:33:29,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-05 16:33:29,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:29,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:29,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:29,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:29,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761642410] [2025-02-05 16:33:29,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761642410] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:33:29,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:33:29,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:33:29,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580180828] [2025-02-05 16:33:29,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:33:29,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:33:29,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:29,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:33:29,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:33:29,553 INFO L87 Difference]: Start difference. First operand 13626 states and 18190 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:29,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:33:29,636 INFO L93 Difference]: Finished difference Result 34814 states and 46680 transitions. [2025-02-05 16:33:29,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:33:29,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-02-05 16:33:29,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:33:29,666 INFO L225 Difference]: With dead ends: 34814 [2025-02-05 16:33:29,666 INFO L226 Difference]: Without dead ends: 21658 [2025-02-05 16:33:29,681 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-02-05 16:33:29,682 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 112 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:33:29,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 425 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:33:29,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21658 states. [2025-02-05 16:33:29,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21658 to 18920. [2025-02-05 16:33:29,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18920 states, 18919 states have (on average 1.3296685871346265) internal successors, (25156), 18919 states have internal predecessors, (25156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:29,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18920 states to 18920 states and 25156 transitions. [2025-02-05 16:33:29,900 INFO L78 Accepts]: Start accepts. Automaton has 18920 states and 25156 transitions. Word has length 73 [2025-02-05 16:33:29,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:33:29,900 INFO L471 AbstractCegarLoop]: Abstraction has 18920 states and 25156 transitions. [2025-02-05 16:33:29,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:29,900 INFO L276 IsEmpty]: Start isEmpty. Operand 18920 states and 25156 transitions. [2025-02-05 16:33:29,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-05 16:33:29,903 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:29,903 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:33:29,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-05 16:33:29,903 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:33:29,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:29,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1974129179, now seen corresponding path program 1 times [2025-02-05 16:33:29,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:29,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120710175] [2025-02-05 16:33:29,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:29,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:29,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-05 16:33:29,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-05 16:33:29,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:29,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:30,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:30,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:30,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120710175] [2025-02-05 16:33:30,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120710175] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:33:30,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:33:30,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:33:30,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038119380] [2025-02-05 16:33:30,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:33:30,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:33:30,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:30,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:33:30,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:33:30,139 INFO L87 Difference]: Start difference. First operand 18920 states and 25156 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:30,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:33:30,201 INFO L93 Difference]: Finished difference Result 19822 states and 26357 transitions. [2025-02-05 16:33:30,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:33:30,202 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2025-02-05 16:33:30,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:33:30,227 INFO L225 Difference]: With dead ends: 19822 [2025-02-05 16:33:30,227 INFO L226 Difference]: Without dead ends: 19820 [2025-02-05 16:33:30,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:33:30,237 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 0 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:33:30,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 960 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:33:30,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19820 states. [2025-02-05 16:33:30,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19820 to 19820. [2025-02-05 16:33:30,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19820 states, 19819 states have (on average 1.294717190574701) internal successors, (25660), 19819 states have internal predecessors, (25660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:30,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19820 states to 19820 states and 25660 transitions. [2025-02-05 16:33:30,444 INFO L78 Accepts]: Start accepts. Automaton has 19820 states and 25660 transitions. Word has length 74 [2025-02-05 16:33:30,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:33:30,445 INFO L471 AbstractCegarLoop]: Abstraction has 19820 states and 25660 transitions. [2025-02-05 16:33:30,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:30,445 INFO L276 IsEmpty]: Start isEmpty. Operand 19820 states and 25660 transitions. [2025-02-05 16:33:30,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 16:33:30,452 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:30,452 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:33:30,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-05 16:33:30,453 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:33:30,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:30,453 INFO L85 PathProgramCache]: Analyzing trace with hash 753803424, now seen corresponding path program 1 times [2025-02-05 16:33:30,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:30,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524439939] [2025-02-05 16:33:30,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:30,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:30,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:33:30,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:33:30,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:30,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:30,733 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:30,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:30,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524439939] [2025-02-05 16:33:30,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524439939] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:33:30,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851018568] [2025-02-05 16:33:30,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:30,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:33:30,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:33:30,737 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:33:30,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 16:33:30,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:33:30,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:33:30,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:30,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:30,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-05 16:33:30,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:33:32,117 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:32,117 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:33:33,589 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:33,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851018568] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:33:33,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:33:33,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 14] total 31 [2025-02-05 16:33:33,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051448426] [2025-02-05 16:33:33,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:33:33,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-05 16:33:33,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:33,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-05 16:33:33,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=837, Unknown=0, NotChecked=0, Total=992 [2025-02-05 16:33:33,592 INFO L87 Difference]: Start difference. First operand 19820 states and 25660 transitions. Second operand has 32 states, 32 states have (on average 7.375) internal successors, (236), 31 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:42,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:33:42,456 INFO L93 Difference]: Finished difference Result 132269 states and 168044 transitions. [2025-02-05 16:33:42,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2025-02-05 16:33:42,457 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 7.375) internal successors, (236), 31 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-02-05 16:33:42,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:33:42,673 INFO L225 Difference]: With dead ends: 132269 [2025-02-05 16:33:42,673 INFO L226 Difference]: Without dead ends: 121727 [2025-02-05 16:33:42,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7885 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=4372, Invalid=18580, Unknown=0, NotChecked=0, Total=22952 [2025-02-05 16:33:42,723 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 4698 mSDsluCounter, 5888 mSDsCounter, 0 mSdLazyCounter, 5962 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4698 SdHoareTripleChecker+Valid, 6240 SdHoareTripleChecker+Invalid, 6039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 5962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:33:42,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4698 Valid, 6240 Invalid, 6039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 5962 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-02-05 16:33:42,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121727 states. [2025-02-05 16:33:43,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121727 to 20379. [2025-02-05 16:33:43,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20379 states, 20378 states have (on average 1.2931592894297772) internal successors, (26352), 20378 states have internal predecessors, (26352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:43,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20379 states to 20379 states and 26352 transitions. [2025-02-05 16:33:43,514 INFO L78 Accepts]: Start accepts. Automaton has 20379 states and 26352 transitions. Word has length 94 [2025-02-05 16:33:43,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:33:43,514 INFO L471 AbstractCegarLoop]: Abstraction has 20379 states and 26352 transitions. [2025-02-05 16:33:43,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 7.375) internal successors, (236), 31 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:43,515 INFO L276 IsEmpty]: Start isEmpty. Operand 20379 states and 26352 transitions. [2025-02-05 16:33:43,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 16:33:43,521 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:43,522 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:33:43,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 16:33:43,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:33:43,723 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:33:43,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:43,724 INFO L85 PathProgramCache]: Analyzing trace with hash -140784899, now seen corresponding path program 1 times [2025-02-05 16:33:43,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:43,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831721611] [2025-02-05 16:33:43,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:43,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:43,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:33:43,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:33:43,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:43,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:43,992 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:43,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:43,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831721611] [2025-02-05 16:33:43,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831721611] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:33:43,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:33:43,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:33:43,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860884674] [2025-02-05 16:33:43,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:33:43,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:33:43,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:43,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:33:43,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:33:43,995 INFO L87 Difference]: Start difference. First operand 20379 states and 26352 transitions. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:44,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:33:44,717 INFO L93 Difference]: Finished difference Result 48985 states and 63207 transitions. [2025-02-05 16:33:44,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 16:33:44,718 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-02-05 16:33:44,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:33:44,772 INFO L225 Difference]: With dead ends: 48985 [2025-02-05 16:33:44,773 INFO L226 Difference]: Without dead ends: 38124 [2025-02-05 16:33:44,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2025-02-05 16:33:44,792 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 701 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 701 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:33:44,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [701 Valid, 765 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:33:44,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38124 states. [2025-02-05 16:33:45,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38124 to 32851. [2025-02-05 16:33:45,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32851 states, 32850 states have (on average 1.2935768645357686) internal successors, (42494), 32850 states have internal predecessors, (42494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:45,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32851 states to 32851 states and 42494 transitions. [2025-02-05 16:33:45,146 INFO L78 Accepts]: Start accepts. Automaton has 32851 states and 42494 transitions. Word has length 94 [2025-02-05 16:33:45,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:33:45,147 INFO L471 AbstractCegarLoop]: Abstraction has 32851 states and 42494 transitions. [2025-02-05 16:33:45,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:45,147 INFO L276 IsEmpty]: Start isEmpty. Operand 32851 states and 42494 transitions. [2025-02-05 16:33:45,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 16:33:45,155 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:45,155 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:33:45,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-05 16:33:45,155 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:33:45,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:45,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1265112673, now seen corresponding path program 1 times [2025-02-05 16:33:45,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:45,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67813703] [2025-02-05 16:33:45,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:45,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:45,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:33:45,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:33:45,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:45,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:45,455 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:45,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:45,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67813703] [2025-02-05 16:33:45,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67813703] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:33:45,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13649179] [2025-02-05 16:33:45,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:45,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:33:45,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:33:45,459 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:33:45,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 16:33:45,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:33:45,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:33:45,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:45,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:45,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-05 16:33:45,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:33:46,486 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:46,487 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:33:47,234 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:47,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13649179] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:33:47,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:33:47,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 30 [2025-02-05 16:33:47,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577610182] [2025-02-05 16:33:47,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:33:47,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-05 16:33:47,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:47,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-05 16:33:47,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=795, Unknown=0, NotChecked=0, Total=930 [2025-02-05 16:33:47,236 INFO L87 Difference]: Start difference. First operand 32851 states and 42494 transitions. Second operand has 31 states, 31 states have (on average 7.903225806451613) internal successors, (245), 30 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:57,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:33:57,064 INFO L93 Difference]: Finished difference Result 179756 states and 229711 transitions. [2025-02-05 16:33:57,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2025-02-05 16:33:57,065 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 7.903225806451613) internal successors, (245), 30 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-02-05 16:33:57,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:33:57,270 INFO L225 Difference]: With dead ends: 179756 [2025-02-05 16:33:57,271 INFO L226 Difference]: Without dead ends: 163222 [2025-02-05 16:33:57,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12486 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=5918, Invalid=27024, Unknown=0, NotChecked=0, Total=32942 [2025-02-05 16:33:57,334 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 4355 mSDsluCounter, 5618 mSDsCounter, 0 mSdLazyCounter, 5893 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4355 SdHoareTripleChecker+Valid, 5956 SdHoareTripleChecker+Invalid, 5970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 5893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:33:57,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4355 Valid, 5956 Invalid, 5970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 5893 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-02-05 16:33:57,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163222 states. [2025-02-05 16:33:58,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163222 to 64786. [2025-02-05 16:33:58,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64786 states, 64785 states have (on average 1.2935864783514703) internal successors, (83805), 64785 states have internal predecessors, (83805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:58,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64786 states to 64786 states and 83805 transitions. [2025-02-05 16:33:58,557 INFO L78 Accepts]: Start accepts. Automaton has 64786 states and 83805 transitions. Word has length 94 [2025-02-05 16:33:58,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:33:58,557 INFO L471 AbstractCegarLoop]: Abstraction has 64786 states and 83805 transitions. [2025-02-05 16:33:58,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 7.903225806451613) internal successors, (245), 30 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:58,557 INFO L276 IsEmpty]: Start isEmpty. Operand 64786 states and 83805 transitions. [2025-02-05 16:33:58,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 16:33:58,569 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:58,569 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:33:58,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 16:33:58,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:33:58,770 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:33:58,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:58,771 INFO L85 PathProgramCache]: Analyzing trace with hash -143307748, now seen corresponding path program 1 times [2025-02-05 16:33:58,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:58,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683262074] [2025-02-05 16:33:58,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:58,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:58,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 16:33:58,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 16:33:58,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:58,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:58,853 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:58,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:58,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683262074] [2025-02-05 16:33:58,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683262074] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:33:58,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:33:58,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:33:58,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391697479] [2025-02-05 16:33:58,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:33:58,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:33:58,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:58,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:33:58,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:33:58,855 INFO L87 Difference]: Start difference. First operand 64786 states and 83805 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:59,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:33:59,191 INFO L93 Difference]: Finished difference Result 125733 states and 162940 transitions. [2025-02-05 16:33:59,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:33:59,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-02-05 16:33:59,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:33:59,297 INFO L225 Difference]: With dead ends: 125733 [2025-02-05 16:33:59,297 INFO L226 Difference]: Without dead ends: 62862 [2025-02-05 16:33:59,346 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-02-05 16:33:59,346 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 93 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:33:59,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 363 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:33:59,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62862 states. [2025-02-05 16:33:59,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62862 to 62742. [2025-02-05 16:33:59,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62742 states, 62741 states have (on average 1.2785897578935623) internal successors, (80220), 62741 states have internal predecessors, (80220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:00,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62742 states to 62742 states and 80220 transitions. [2025-02-05 16:34:00,559 INFO L78 Accepts]: Start accepts. Automaton has 62742 states and 80220 transitions. Word has length 95 [2025-02-05 16:34:00,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:00,559 INFO L471 AbstractCegarLoop]: Abstraction has 62742 states and 80220 transitions. [2025-02-05 16:34:00,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:00,559 INFO L276 IsEmpty]: Start isEmpty. Operand 62742 states and 80220 transitions. [2025-02-05 16:34:00,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 16:34:00,568 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:00,568 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:00,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-05 16:34:00,568 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:00,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:00,569 INFO L85 PathProgramCache]: Analyzing trace with hash -119194167, now seen corresponding path program 1 times [2025-02-05 16:34:00,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:00,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188935985] [2025-02-05 16:34:00,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:00,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:00,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 16:34:00,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 16:34:00,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:00,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:00,746 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:00,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:00,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188935985] [2025-02-05 16:34:00,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188935985] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:34:00,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666972033] [2025-02-05 16:34:00,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:00,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:34:00,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:34:00,750 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:34:00,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 16:34:00,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 16:34:00,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 16:34:00,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:00,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:00,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-05 16:34:00,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:34:01,138 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:01,139 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:34:01,418 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:01,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666972033] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:34:01,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:34:01,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 6] total 12 [2025-02-05 16:34:01,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254983627] [2025-02-05 16:34:01,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:34:01,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 16:34:01,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:01,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 16:34:01,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:34:01,420 INFO L87 Difference]: Start difference. First operand 62742 states and 80220 transitions. Second operand has 12 states, 12 states have (on average 16.666666666666668) internal successors, (200), 12 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:02,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:02,017 INFO L93 Difference]: Finished difference Result 179101 states and 227562 transitions. [2025-02-05 16:34:02,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:34:02,017 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 16.666666666666668) internal successors, (200), 12 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-02-05 16:34:02,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:02,158 INFO L225 Difference]: With dead ends: 179101 [2025-02-05 16:34:02,158 INFO L226 Difference]: Without dead ends: 118156 [2025-02-05 16:34:02,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 182 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-02-05 16:34:02,183 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 690 mSDsluCounter, 1373 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 1647 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:02,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 1647 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:34:02,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118156 states. [2025-02-05 16:34:03,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118156 to 91932. [2025-02-05 16:34:03,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91932 states, 91931 states have (on average 1.270735660440983) internal successors, (116820), 91931 states have internal predecessors, (116820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:03,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91932 states to 91932 states and 116820 transitions. [2025-02-05 16:34:03,442 INFO L78 Accepts]: Start accepts. Automaton has 91932 states and 116820 transitions. Word has length 95 [2025-02-05 16:34:03,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:03,443 INFO L471 AbstractCegarLoop]: Abstraction has 91932 states and 116820 transitions. [2025-02-05 16:34:03,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 16.666666666666668) internal successors, (200), 12 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:03,443 INFO L276 IsEmpty]: Start isEmpty. Operand 91932 states and 116820 transitions. [2025-02-05 16:34:03,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-05 16:34:03,455 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:03,455 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:03,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 16:34:03,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:34:03,656 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:03,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:03,657 INFO L85 PathProgramCache]: Analyzing trace with hash -144978053, now seen corresponding path program 1 times [2025-02-05 16:34:03,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:03,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782249009] [2025-02-05 16:34:03,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:03,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:03,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-05 16:34:03,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-05 16:34:03,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:03,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:03,752 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:03,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:03,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782249009] [2025-02-05 16:34:03,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782249009] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:34:03,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458247134] [2025-02-05 16:34:03,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:03,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:34:03,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:34:03,756 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:34:03,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 16:34:03,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-05 16:34:03,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-05 16:34:03,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:03,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:03,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 16:34:03,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:34:04,237 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:04,237 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:34:04,408 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:04,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458247134] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:34:04,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:34:04,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2025-02-05 16:34:04,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980320860] [2025-02-05 16:34:04,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:34:04,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 16:34:04,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:04,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 16:34:04,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-02-05 16:34:04,411 INFO L87 Difference]: Start difference. First operand 91932 states and 116820 transitions. Second operand has 14 states, 14 states have (on average 19.5) internal successors, (273), 14 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:05,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:05,559 INFO L93 Difference]: Finished difference Result 230266 states and 291677 transitions. [2025-02-05 16:34:05,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:34:05,559 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 19.5) internal successors, (273), 14 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2025-02-05 16:34:05,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:05,751 INFO L225 Difference]: With dead ends: 230266 [2025-02-05 16:34:05,751 INFO L226 Difference]: Without dead ends: 139909 [2025-02-05 16:34:05,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 199 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2025-02-05 16:34:05,806 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 2148 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2148 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:05,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2148 Valid, 652 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:34:05,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139909 states. [2025-02-05 16:34:06,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139909 to 106094. [2025-02-05 16:34:06,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106094 states, 106093 states have (on average 1.2399687067007248) internal successors, (131552), 106093 states have internal predecessors, (131552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:07,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106094 states to 106094 states and 131552 transitions. [2025-02-05 16:34:07,245 INFO L78 Accepts]: Start accepts. Automaton has 106094 states and 131552 transitions. Word has length 103 [2025-02-05 16:34:07,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:07,246 INFO L471 AbstractCegarLoop]: Abstraction has 106094 states and 131552 transitions. [2025-02-05 16:34:07,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 19.5) internal successors, (273), 14 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:07,246 INFO L276 IsEmpty]: Start isEmpty. Operand 106094 states and 131552 transitions. [2025-02-05 16:34:07,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-05 16:34:07,254 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:07,254 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:07,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 16:34:07,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-02-05 16:34:07,455 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:07,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:07,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1007675532, now seen corresponding path program 1 times [2025-02-05 16:34:07,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:07,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196611431] [2025-02-05 16:34:07,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:07,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:07,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-05 16:34:07,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-05 16:34:07,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:07,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:07,533 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:07,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:07,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196611431] [2025-02-05 16:34:07,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196611431] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:34:07,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267931876] [2025-02-05 16:34:07,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:07,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:34:07,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:34:07,537 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:34:07,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 16:34:07,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-05 16:34:07,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-05 16:34:07,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:07,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:07,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 16:34:07,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:34:07,966 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:07,967 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:34:08,132 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:08,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267931876] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:34:08,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:34:08,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2025-02-05 16:34:08,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951645317] [2025-02-05 16:34:08,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:34:08,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 16:34:08,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:08,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 16:34:08,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-02-05 16:34:08,134 INFO L87 Difference]: Start difference. First operand 106094 states and 131552 transitions. Second operand has 14 states, 14 states have (on average 20.428571428571427) internal successors, (286), 14 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:08,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:08,959 INFO L93 Difference]: Finished difference Result 195155 states and 241712 transitions. [2025-02-05 16:34:08,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:34:08,960 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 20.428571428571427) internal successors, (286), 14 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2025-02-05 16:34:08,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:09,083 INFO L225 Difference]: With dead ends: 195155 [2025-02-05 16:34:09,083 INFO L226 Difference]: Without dead ends: 90161 [2025-02-05 16:34:09,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 201 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2025-02-05 16:34:09,126 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 1624 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1624 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:09,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1624 Valid, 735 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:34:09,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90161 states. [2025-02-05 16:34:10,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90161 to 89077. [2025-02-05 16:34:10,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89077 states, 89076 states have (on average 1.2120997799631774) internal successors, (107969), 89076 states have internal predecessors, (107969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:10,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89077 states to 89077 states and 107969 transitions. [2025-02-05 16:34:10,326 INFO L78 Accepts]: Start accepts. Automaton has 89077 states and 107969 transitions. Word has length 104 [2025-02-05 16:34:10,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:10,326 INFO L471 AbstractCegarLoop]: Abstraction has 89077 states and 107969 transitions. [2025-02-05 16:34:10,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 20.428571428571427) internal successors, (286), 14 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:10,327 INFO L276 IsEmpty]: Start isEmpty. Operand 89077 states and 107969 transitions. [2025-02-05 16:34:10,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-05 16:34:10,334 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:10,334 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:10,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 16:34:10,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-02-05 16:34:10,535 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:10,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:10,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1020181503, now seen corresponding path program 1 times [2025-02-05 16:34:10,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:10,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670011997] [2025-02-05 16:34:10,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:10,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:10,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-05 16:34:10,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-05 16:34:10,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:10,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:10,612 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:10,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:10,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670011997] [2025-02-05 16:34:10,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670011997] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:10,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:10,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:34:10,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206832082] [2025-02-05 16:34:10,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:10,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:34:10,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:10,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:34:10,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:34:10,615 INFO L87 Difference]: Start difference. First operand 89077 states and 107969 transitions. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:11,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:11,106 INFO L93 Difference]: Finished difference Result 174364 states and 211294 transitions. [2025-02-05 16:34:11,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:34:11,107 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2025-02-05 16:34:11,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:11,213 INFO L225 Difference]: With dead ends: 174364 [2025-02-05 16:34:11,213 INFO L226 Difference]: Without dead ends: 86362 [2025-02-05 16:34:11,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:34:11,268 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 346 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:11,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 366 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:34:11,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86362 states. [2025-02-05 16:34:12,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86362 to 81207. [2025-02-05 16:34:12,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81207 states, 81206 states have (on average 1.1878555771741004) internal successors, (96461), 81206 states have internal predecessors, (96461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:12,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81207 states to 81207 states and 96461 transitions. [2025-02-05 16:34:12,340 INFO L78 Accepts]: Start accepts. Automaton has 81207 states and 96461 transitions. Word has length 104 [2025-02-05 16:34:12,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:12,340 INFO L471 AbstractCegarLoop]: Abstraction has 81207 states and 96461 transitions. [2025-02-05 16:34:12,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:12,340 INFO L276 IsEmpty]: Start isEmpty. Operand 81207 states and 96461 transitions. [2025-02-05 16:34:12,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-05 16:34:12,349 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:12,350 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:12,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-05 16:34:12,350 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:12,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:12,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1699833742, now seen corresponding path program 1 times [2025-02-05 16:34:12,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:12,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285366327] [2025-02-05 16:34:12,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:12,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:12,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-05 16:34:12,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-05 16:34:12,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:12,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:12,723 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 16:34:12,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:12,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285366327] [2025-02-05 16:34:12,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285366327] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:12,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:12,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:34:12,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529779528] [2025-02-05 16:34:12,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:12,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:34:12,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:12,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:34:12,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:34:12,726 INFO L87 Difference]: Start difference. First operand 81207 states and 96461 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:13,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:13,004 INFO L93 Difference]: Finished difference Result 150357 states and 178990 transitions. [2025-02-05 16:34:13,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:34:13,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2025-02-05 16:34:13,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:13,117 INFO L225 Difference]: With dead ends: 150357 [2025-02-05 16:34:13,117 INFO L226 Difference]: Without dead ends: 103890 [2025-02-05 16:34:13,162 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-02-05 16:34:13,163 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 143 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:13,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 280 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:34:13,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103890 states. [2025-02-05 16:34:14,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103890 to 72855. [2025-02-05 16:34:14,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72855 states, 72854 states have (on average 1.1856452631289978) internal successors, (86379), 72854 states have internal predecessors, (86379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:14,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72855 states to 72855 states and 86379 transitions. [2025-02-05 16:34:14,233 INFO L78 Accepts]: Start accepts. Automaton has 72855 states and 86379 transitions. Word has length 106 [2025-02-05 16:34:14,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:14,234 INFO L471 AbstractCegarLoop]: Abstraction has 72855 states and 86379 transitions. [2025-02-05 16:34:14,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:14,234 INFO L276 IsEmpty]: Start isEmpty. Operand 72855 states and 86379 transitions. [2025-02-05 16:34:14,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-05 16:34:14,241 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:14,241 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:14,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-05 16:34:14,242 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:14,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:14,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1373705011, now seen corresponding path program 1 times [2025-02-05 16:34:14,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:14,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835030432] [2025-02-05 16:34:14,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:14,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:14,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-05 16:34:14,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-05 16:34:14,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:14,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:14,302 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:14,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:14,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835030432] [2025-02-05 16:34:14,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835030432] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:14,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:14,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:34:14,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198973508] [2025-02-05 16:34:14,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:14,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:34:14,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:14,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:34:14,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:34:14,306 INFO L87 Difference]: Start difference. First operand 72855 states and 86379 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:14,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:14,635 INFO L93 Difference]: Finished difference Result 135523 states and 160826 transitions. [2025-02-05 16:34:14,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:34:14,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2025-02-05 16:34:14,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:14,768 INFO L225 Difference]: With dead ends: 135523 [2025-02-05 16:34:14,768 INFO L226 Difference]: Without dead ends: 102889 [2025-02-05 16:34:14,815 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-02-05 16:34:14,815 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 92 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:14,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 414 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:34:14,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102889 states. [2025-02-05 16:34:15,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102889 to 71889. [2025-02-05 16:34:15,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71889 states, 71888 states have (on average 1.1794458045849099) internal successors, (84788), 71888 states have internal predecessors, (84788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:15,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71889 states to 71889 states and 84788 transitions. [2025-02-05 16:34:15,836 INFO L78 Accepts]: Start accepts. Automaton has 71889 states and 84788 transitions. Word has length 106 [2025-02-05 16:34:15,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:15,837 INFO L471 AbstractCegarLoop]: Abstraction has 71889 states and 84788 transitions. [2025-02-05 16:34:15,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:15,837 INFO L276 IsEmpty]: Start isEmpty. Operand 71889 states and 84788 transitions. [2025-02-05 16:34:15,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-05 16:34:15,844 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:15,844 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:15,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-02-05 16:34:15,844 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:15,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:15,845 INFO L85 PathProgramCache]: Analyzing trace with hash 735308871, now seen corresponding path program 1 times [2025-02-05 16:34:15,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:15,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514183354] [2025-02-05 16:34:15,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:15,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:15,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-05 16:34:15,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-05 16:34:15,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:15,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:16,650 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:16,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:16,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514183354] [2025-02-05 16:34:16,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514183354] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:16,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:16,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-05 16:34:16,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118274816] [2025-02-05 16:34:16,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:16,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 16:34:16,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:16,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 16:34:16,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2025-02-05 16:34:16,651 INFO L87 Difference]: Start difference. First operand 71889 states and 84788 transitions. Second operand has 16 states, 16 states have (on average 6.6875) internal successors, (107), 16 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:17,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:17,246 INFO L93 Difference]: Finished difference Result 86170 states and 101607 transitions. [2025-02-05 16:34:17,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-05 16:34:17,246 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.6875) internal successors, (107), 16 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2025-02-05 16:34:17,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:17,326 INFO L225 Difference]: With dead ends: 86170 [2025-02-05 16:34:17,326 INFO L226 Difference]: Without dead ends: 79421 [2025-02-05 16:34:17,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=751, Unknown=0, NotChecked=0, Total=930 [2025-02-05 16:34:17,352 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 552 mSDsluCounter, 2542 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 2810 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:17,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 2810 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:34:17,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79421 states. [2025-02-05 16:34:17,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79421 to 78789. [2025-02-05 16:34:18,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78789 states, 78788 states have (on average 1.1784535716098898) internal successors, (92848), 78788 states have internal predecessors, (92848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:18,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78789 states to 78789 states and 92848 transitions. [2025-02-05 16:34:18,134 INFO L78 Accepts]: Start accepts. Automaton has 78789 states and 92848 transitions. Word has length 107 [2025-02-05 16:34:18,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:18,134 INFO L471 AbstractCegarLoop]: Abstraction has 78789 states and 92848 transitions. [2025-02-05 16:34:18,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.6875) internal successors, (107), 16 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:18,134 INFO L276 IsEmpty]: Start isEmpty. Operand 78789 states and 92848 transitions. [2025-02-05 16:34:18,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-05 16:34:18,142 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:18,142 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:18,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-02-05 16:34:18,142 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:18,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:18,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1092530446, now seen corresponding path program 1 times [2025-02-05 16:34:18,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:18,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394347254] [2025-02-05 16:34:18,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:18,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:18,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-05 16:34:18,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-05 16:34:18,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:18,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:18,848 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:18,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:18,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394347254] [2025-02-05 16:34:18,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394347254] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:18,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:18,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-02-05 16:34:18,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379498762] [2025-02-05 16:34:18,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:18,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 16:34:18,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:18,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 16:34:18,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2025-02-05 16:34:18,850 INFO L87 Difference]: Start difference. First operand 78789 states and 92848 transitions. Second operand has 19 states, 19 states have (on average 5.631578947368421) internal successors, (107), 19 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:20,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:20,795 INFO L93 Difference]: Finished difference Result 135995 states and 160980 transitions. [2025-02-05 16:34:20,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-02-05 16:34:20,796 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.631578947368421) internal successors, (107), 19 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2025-02-05 16:34:20,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:20,965 INFO L225 Difference]: With dead ends: 135995 [2025-02-05 16:34:20,965 INFO L226 Difference]: Without dead ends: 129790 [2025-02-05 16:34:21,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=258, Invalid=1634, Unknown=0, NotChecked=0, Total=1892 [2025-02-05 16:34:21,010 INFO L435 NwaCegarLoop]: 344 mSDtfsCounter, 797 mSDsluCounter, 4679 mSDsCounter, 0 mSdLazyCounter, 1955 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 5023 SdHoareTripleChecker+Invalid, 1966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:21,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 5023 Invalid, 1966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1955 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 16:34:21,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129790 states. [2025-02-05 16:34:22,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129790 to 83069. [2025-02-05 16:34:22,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83069 states, 83068 states have (on average 1.179973034140704) internal successors, (98018), 83068 states have internal predecessors, (98018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:22,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83069 states to 83069 states and 98018 transitions. [2025-02-05 16:34:22,274 INFO L78 Accepts]: Start accepts. Automaton has 83069 states and 98018 transitions. Word has length 107 [2025-02-05 16:34:22,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:22,275 INFO L471 AbstractCegarLoop]: Abstraction has 83069 states and 98018 transitions. [2025-02-05 16:34:22,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.631578947368421) internal successors, (107), 19 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:22,275 INFO L276 IsEmpty]: Start isEmpty. Operand 83069 states and 98018 transitions. [2025-02-05 16:34:22,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-05 16:34:22,280 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:22,281 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:22,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-02-05 16:34:22,281 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:22,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:22,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1611032847, now seen corresponding path program 1 times [2025-02-05 16:34:22,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:22,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081111960] [2025-02-05 16:34:22,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:22,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:22,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-05 16:34:22,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-05 16:34:22,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:22,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:22,337 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 16:34:22,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:22,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081111960] [2025-02-05 16:34:22,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081111960] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:22,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:22,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:34:22,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110699776] [2025-02-05 16:34:22,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:22,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:34:22,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:22,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:34:22,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:34:22,338 INFO L87 Difference]: Start difference. First operand 83069 states and 98018 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:22,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:22,775 INFO L93 Difference]: Finished difference Result 136121 states and 160771 transitions. [2025-02-05 16:34:22,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:34:22,775 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2025-02-05 16:34:22,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:22,904 INFO L225 Difference]: With dead ends: 136121 [2025-02-05 16:34:22,904 INFO L226 Difference]: Without dead ends: 105914 [2025-02-05 16:34:23,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:34:23,288 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 115 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:23,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 434 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:34:23,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105914 states. [2025-02-05 16:34:23,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105914 to 90405. [2025-02-05 16:34:23,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90405 states, 90404 states have (on average 1.179859298261139) internal successors, (106664), 90404 states have internal predecessors, (106664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)